Base | Representation |
---|---|
bin | 10110111000000101010101… |
… | …111001100011100100010110 |
3 | 111012020022201001210210111102 |
4 | 112320011111321203210112 |
5 | 101141402412303410204 |
6 | 553552024530110102 |
7 | 30122623420020632 |
oct | 2670052571434426 |
9 | 435208631723442 |
10 | 100611050060054 |
11 | 2a06a9a791a406 |
12 | b34b11911b332 |
13 | 441a7731a7611 |
14 | 1abb85a877dc2 |
15 | b971ce7b941e |
hex | 5b8155e63916 |
100611050060054 has 8 divisors (see below), whose sum is σ = 150951452980368. Its totient is φ = 50293899066600.
The previous prime is 100611050060051. The next prime is 100611050060057. The reversal of 100611050060054 is 450060050116001.
It is an interprime number because it is at equal distance from previous prime (100611050060051) and next prime (100611050060057).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 100611050059999 and 100611050060026.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100611050060051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5812970897 + ... + 5812988204.
It is an arithmetic number, because the mean of its divisors is an integer number (18868931622546).
Almost surely, 2100611050060054 is an apocalyptic number.
100611050060054 is a deficient number, since it is larger than the sum of its proper divisors (50340402920314).
100611050060054 is a wasteful number, since it uses less digits than its factorization.
100611050060054 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11625963430.
The product of its (nonzero) digits is 3600, while the sum is 29.
The spelling of 100611050060054 in words is "one hundred trillion, six hundred eleven billion, fifty million, sixty thousand, fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •