Base | Representation |
---|---|
bin | 1001001001001101100011… |
… | …0011011110100100100000 |
3 | 1022121010202211220201022012 |
4 | 2102103120303132210200 |
5 | 2304210301334031411 |
6 | 33214402505532052 |
7 | 2055240021105362 |
oct | 222233063364440 |
9 | 38533684821265 |
10 | 10053860845856 |
11 | 3226900386773 |
12 | 11646097a4028 |
13 | 57c0c8a47609 |
14 | 26a87650cd32 |
15 | 1267cd72218b |
hex | 924d8cde920 |
10053860845856 has 96 divisors (see below), whose sum is σ = 20982910249728. Its totient is φ = 4725578813440.
The previous prime is 10053860845807. The next prime is 10053860845871. The reversal of 10053860845856 is 65854806835001.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 10053860845795 and 10053860845804.
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 15 ways as a sum of consecutive naturals, for example, 2505320906 + ... + 2505324918.
It is an arithmetic number, because the mean of its divisors is an integer number (218571981768).
Almost surely, 210053860845856 is an apocalyptic number.
10053860845856 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
10053860845856 is an abundant number, since it is smaller than the sum of its proper divisors (10929049403872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10053860845856 is a wasteful number, since it uses less digits than its factorization.
10053860845856 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8394 (or 8386 counting only the distinct ones).
The product of its (nonzero) digits is 27648000, while the sum is 59.
The spelling of 10053860845856 in words is "ten trillion, fifty-three billion, eight hundred sixty million, eight hundred forty-five thousand, eight hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •