Base | Representation |
---|---|
bin | 10110110000111101111000… |
… | …010000011001010111111011 |
3 | 111010111120101100012220000111 |
4 | 112300331320100121113323 |
5 | 101110344324022414321 |
6 | 552535224550245151 |
7 | 30042401333555122 |
oct | 2660757020312773 |
9 | 433446340186014 |
10 | 100122000201211 |
11 | 299a1557a3604a |
12 | b2903933567b7 |
13 | 43b3605848111 |
14 | 1aa1d05a66ab9 |
15 | b8960a1775e1 |
hex | 5b0f784195fb |
100122000201211 has 8 divisors (see below), whose sum is σ = 103601378559600. Its totient is φ = 96644414882400.
The previous prime is 100122000201193. The next prime is 100122000201323. The reversal of 100122000201211 is 112102000221001.
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 100122000201211 - 221 = 100121998104059 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100122000201191 and 100122000201200.
It is not an unprimeable number, because it can be changed into a prime (100122000201011) 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, 448146276 + ... + 448369633.
It is an arithmetic number, because the mean of its divisors is an integer number (12950172319950).
Almost surely, 2100122000201211 is an apocalyptic number.
100122000201211 is a deficient number, since it is larger than the sum of its proper divisors (3479378358389).
100122000201211 is an equidigital number, since it uses as much as digits as its factorization.
100122000201211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 896519789.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 100122000201211 its reverse (112102000221001), we get a palindrome (212224000422212).
The spelling of 100122000201211 in words is "one hundred trillion, one hundred twenty-two billion, two hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •