Base | Representation |
---|---|
bin | 101110100111110100… |
… | …0010010111010110001 |
3 | 100120102112211200220110 |
4 | 1131033220102322301 |
5 | 3120021233223441 |
6 | 113554455331533 |
7 | 10143033516150 |
oct | 1351750227261 |
9 | 316375750813 |
10 | 100120211121 |
11 | 39508281537 |
12 | 174a2080ba9 |
13 | 95976ab798 |
14 | 4bbadd3597 |
15 | 290ea82b16 |
hex | 174fa12eb1 |
100120211121 has 8 divisors (see below), whose sum is σ = 152564131264. Its totient is φ = 57211549200.
The previous prime is 100120211083. The next prime is 100120211227. The reversal of 100120211121 is 121112021001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100120211121 - 214 = 100120194737 is a prime.
It is a super-2 number, since 2×1001202111212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 100120211097 and 100120211106.
It is not an unprimeable number, because it can be changed into a prime (100120211021) 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, 2383814530 + ... + 2383814571.
It is an arithmetic number, because the mean of its divisors is an integer number (19070516408).
Almost surely, 2100120211121 is an apocalyptic number.
It is an amenable number.
100120211121 is a deficient number, since it is larger than the sum of its proper divisors (52443920143).
100120211121 is an equidigital number, since it uses as much as digits as its factorization.
100120211121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4767629111.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 100120211121 its reverse (121112021001), we get a palindrome (221232232122).
The spelling of 100120211121 in words is "one hundred billion, one hundred twenty million, two hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •