Base | Representation |
---|---|
bin | 10110110000111100111101… |
… | …010010111110100110000011 |
3 | 111010111110211101220101112020 |
4 | 112300330331102332212003 |
5 | 101110340312310202321 |
6 | 552534542452532523 |
7 | 30042334662643254 |
oct | 2660747522764603 |
9 | 433443741811466 |
10 | 100121011022211 |
11 | 299a109a633243 |
12 | b290158021143 |
13 | 43b34a89293ba |
14 | 1aa1c50534b2b |
15 | b8959d3d24c6 |
hex | 5b0f3d4be983 |
100121011022211 has 8 divisors (see below), whose sum is σ = 134870915191824. Its totient is φ = 66059223767040.
The previous prime is 100121011022141. The next prime is 100121011022237. The reversal of 100121011022211 is 112220110121001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100121011022211 - 227 = 100120876804483 is a prime.
It is a super-2 number, since 2×1001210110222112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (100121011022281) 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, 172029228270 + ... + 172029228851.
It is an arithmetic number, because the mean of its divisors is an integer number (16858864398978).
Almost surely, 2100121011022211 is an apocalyptic number.
100121011022211 is a deficient number, since it is larger than the sum of its proper divisors (34749904169613).
100121011022211 is an equidigital number, since it uses as much as digits as its factorization.
100121011022211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 344058457221.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 100121011022211 its reverse (112220110121001), we get a palindrome (212341121143212).
The spelling of 100121011022211 in words is "one hundred trillion, one hundred twenty-one billion, eleven million, twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •