Base | Representation |
---|---|
bin | 100000010101111… |
… | …0000101011011000 |
3 | 2210122000112220220 |
4 | 1000223300223120 |
5 | 4210303312100 |
6 | 255403520040 |
7 | 35615106315 |
oct | 10053605330 |
9 | 2718015826 |
10 | 1085213400 |
11 | 507635987 |
12 | 263529020 |
13 | 143aa450b |
14 | a41add0c |
15 | 65414aa0 |
hex | 40af0ad8 |
1085213400 has 96 divisors (see below), whose sum is σ = 3376190160. Its totient is φ = 288355840.
The previous prime is 1085213369. The next prime is 1085213419. The reversal of 1085213400 is 43125801.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 172714 + ... + 178886.
Almost surely, 21085213400 is an apocalyptic number.
1085213400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1085213400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1688095080).
1085213400 is an abundant number, since it is smaller than the sum of its proper divisors (2290976760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1085213400 is a wasteful number, since it uses less digits than its factorization.
1085213400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6485 (or 6476 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 24.
The square root of 1085213400 is about 32942.5773126512. The cubic root of 1085213400 is about 1027.6338054858.
The spelling of 1085213400 in words is "one billion, eighty-five million, two hundred thirteen thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •