Base | Representation |
---|---|
bin | 10110110000111101000011… |
… | …001100101000000000010000 |
3 | 111010111111002022012000010011 |
4 | 112300331003030220000100 |
5 | 101110341013131120422 |
6 | 552535000350444304 |
7 | 30042340304263006 |
oct | 2660750314500020 |
9 | 433444068160104 |
10 | 100121110020112 |
11 | 299a11404aa895 |
12 | b290185203694 |
13 | 43b34c32aba3c |
14 | 1aa1c5d744a76 |
15 | b895a6e3a077 |
hex | 5b0f43328010 |
100121110020112 has 20 divisors (see below), whose sum is σ = 194279012825040. Its totient is φ = 49984590581408.
The previous prime is 100121110020101. The next prime is 100121110020157. The reversal of 100121110020112 is 211020011121001.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 100121110020092 and 100121110020101.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4747765918 + ... + 4747787005.
It is an arithmetic number, because the mean of its divisors is an integer number (9713950641252).
Almost surely, 2100121110020112 is an apocalyptic number.
It is an amenable number.
100121110020112 is a deficient number, since it is larger than the sum of its proper divisors (94157902804928).
100121110020112 is an equidigital number, since it uses as much as digits as its factorization.
100121110020112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9495553590 (or 9495553584 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 100121110020112 its reverse (211020011121001), we get a palindrome (311141121141113).
The spelling of 100121110020112 in words is "one hundred trillion, one hundred twenty-one billion, one hundred ten million, twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •