Base | Representation |
---|---|
bin | 10110110000111100000111… |
… | …101101111100010010110011 |
3 | 111010111101111202110110220012 |
4 | 112300330013231330102303 |
5 | 101110331442200333021 |
6 | 552534313342205135 |
7 | 30042303466262123 |
oct | 2660740755742263 |
9 | 433441452413805 |
10 | 100120112121011 |
11 | 299a0779191494 |
12 | b28bb46b837ab |
13 | 43b3394628bb8 |
14 | 1aa1ba6dc2c83 |
15 | b8954952135b |
hex | 5b0f07b7c4b3 |
100120112121011 has 8 divisors (see below), whose sum is σ = 102568163320224. Its totient is φ = 97672351266880.
The previous prime is 100120112120993. The next prime is 100120112121049. The reversal of 100120112121011 is 110121211021001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100120112121011 - 214 = 100120112104627 is a prime.
It is a super-2 number, since 2×1001201121210112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100120112126011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 71888096 + ... + 73267581.
It is an arithmetic number, because the mean of its divisors is an integer number (12821020415028).
Almost surely, 2100120112121011 is an apocalyptic number.
100120112121011 is a deficient number, since it is larger than the sum of its proper divisors (2448051199213).
100120112121011 is a wasteful number, since it uses less digits than its factorization.
100120112121011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 145172541.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 100120112121011 its reverse (110121211021001), we get a palindrome (210241323142012).
The spelling of 100120112121011 in words is "one hundred trillion, one hundred twenty billion, one hundred twelve million, one hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •