| Base | Representation |
|---|---|
| bin | 10110101111010101101011… |
| … | …001001011011001010000000 |
| 3 | 111010002212120121011122101122 |
| 4 | 112233111223021123022000 |
| 5 | 101102031201421320000 |
| 6 | 552412002155051412 |
| 7 | 30031330533222224 |
| oct | 2657255311331200 |
| 9 | 433085517148348 |
| 10 | 100010111120000 |
| 11 | 299590605182a4 |
| 12 | b272767a40b68 |
| 13 | 43a5bb3b6b4a3 |
| 14 | 1a9a72da1c784 |
| 15 | b8675c2cc085 |
| hex | 5af56b25b280 |
100010111120000 has 320 divisors, whose sum is σ = 252248767056000. Its totient is φ = 39479616000000.
The previous prime is 100010111119949. The next prime is 100010111120173. The reversal of 100010111120000 is 21111010001.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (320).
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a self number, because there is not a number n which added to its sum of digits gives 100010111120000.
It is an unprimeable number.
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 39 ways as a sum of consecutive naturals, for example, 2512860101 + ... + 2512899899.
It is an arithmetic number, because the mean of its divisors is an integer number (788277397050).
Almost surely, 2100010111120000 is an apocalyptic number.
100010111120000 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 100010111120000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (126124383528000).
100010111120000 is an abundant number, since it is smaller than the sum of its proper divisors (152238655936000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100010111120000 is an equidigital number, since it uses as much as digits as its factorization.
100010111120000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40245 (or 40218 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 100010111120000 its reverse (21111010001), we get a palindrome (100031222130001).
The spelling of 100010111120000 in words is "one hundred trillion, ten billion, one hundred eleven million, one hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •