Base | Representation |
---|---|
bin | 1001001001010011111000… |
… | …1000111011101010000000 |
3 | 1022121022011022222220120211 |
4 | 2102110332020323222000 |
5 | 2304222242102000312 |
6 | 33215243321243504 |
7 | 2055330113652211 |
oct | 222247610735200 |
9 | 38538138886524 |
10 | 10055560968832 |
11 | 32275a3023285 |
12 | 1164a03033594 |
13 | 57c30a037b42 |
14 | 26a998227408 |
15 | 12687caec3a7 |
hex | 9253e23ba80 |
10055560968832 has 32 divisors (see below), whose sum is σ = 20167009636500. Its totient is φ = 4994036981760.
The previous prime is 10055560968731. The next prime is 10055560968841. The reversal of 10055560968832 is 23886906555001.
It can be written as a sum of positive squares in 2 ways, for example, as 8493400950336 + 1562160018496 = 2914344^2 + 1249864^2 .
It is a tau number, because it is divible by the number of its divisors (32).
It is a super-2 number, since 2×100555609688322 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 263601969 + ... + 263640112.
Almost surely, 210055560968832 is an apocalyptic number.
It is an amenable number.
10055560968832 is an abundant number, since it is smaller than the sum of its proper divisors (10111448667668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10055560968832 is an equidigital number, since it uses as much as digits as its factorization.
10055560968832 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 527242244 (or 527242232 counting only the distinct ones).
The product of its (nonzero) digits is 15552000, while the sum is 58.
The spelling of 10055560968832 in words is "ten trillion, fifty-five billion, five hundred sixty million, nine hundred sixty-eight thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •