Base | Representation |
---|---|
bin | 10011100110010011… |
… | …01100100001000110 |
3 | 1000011021201200001222 |
4 | 21303021230201012 |
5 | 133022043343240 |
6 | 4500023520342 |
7 | 521512205135 |
oct | 116311544106 |
9 | 30137650058 |
10 | 10521856070 |
11 | 450a34a220 |
12 | 20578b90b2 |
13 | cb8b5574b |
14 | 71b5a791c |
15 | 418ae1eb5 |
hex | 27326c846 |
10521856070 has 64 divisors (see below), whose sum is σ = 21897340416. Its totient is φ = 3597626880.
The previous prime is 10521856063. The next prime is 10521856091. The reversal of 10521856070 is 7065812501.
It is a super-2 number, since 2×105218560702 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 10521856070.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2666519 + ... + 2670461.
It is an arithmetic number, because the mean of its divisors is an integer number (342145944).
Almost surely, 210521856070 is an apocalyptic number.
10521856070 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10521856070 is an abundant number, since it is smaller than the sum of its proper divisors (11375484346).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10521856070 is a wasteful number, since it uses less digits than its factorization.
10521856070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5405.
The product of its (nonzero) digits is 16800, while the sum is 35.
The spelling of 10521856070 in words is "ten billion, five hundred twenty-one million, eight hundred fifty-six thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •