Base | Representation |
---|---|
bin | 10110110000111101000010… |
… | …101110000111011001000011 |
3 | 111010111111001202010200001121 |
4 | 112300331002232013121003 |
5 | 101110341004104202321 |
6 | 552534555503213111 |
7 | 30042340146302344 |
oct | 2660750256073103 |
9 | 433444052120047 |
10 | 100121102022211 |
11 | 299a1136a37956 |
12 | b2901825a7197 |
13 | 43b34c173b55a |
14 | 1aa1c5c6620cb |
15 | b895a63aa441 |
hex | 5b0f42b87643 |
100121102022211 has 8 divisors (see below), whose sum is σ = 101328075800784. Its totient is φ = 98914144801920.
The previous prime is 100121102022209. The next prime is 100121102022251. The reversal of 100121102022211 is 112220201121001.
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 100121102022211 - 21 = 100121102022209 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100121102022251) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 8248615 + ... + 16379311.
It is an arithmetic number, because the mean of its divisors is an integer number (12666009475098).
Almost surely, 2100121102022211 is an apocalyptic number.
100121102022211 is a deficient number, since it is larger than the sum of its proper divisors (1206973778573).
100121102022211 is an equidigital number, since it uses as much as digits as its factorization.
100121102022211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8279141.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 100121102022211 its reverse (112220201121001), we get a palindrome (212341303143212).
The spelling of 100121102022211 in words is "one hundred trillion, one hundred twenty-one billion, one hundred two million, twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •