Base | Representation |
---|---|
bin | 10111000000101010111000… |
… | …111011110000001111110011 |
3 | 111021022201210012110020101020 |
4 | 113000222320323300033303 |
5 | 101231034344224201321 |
6 | 555123053105510523 |
7 | 30213353101425420 |
oct | 2700527073601763 |
9 | 437281705406336 |
10 | 101201122100211 |
11 | 2a278178132811 |
12 | b425557042443 |
13 | 44612c004b973 |
14 | 1adc23638cd47 |
15 | ba7717c594c6 |
hex | 5c0ab8ef03f3 |
101201122100211 has 8 divisors (see below), whose sum is σ = 154211233676544. Its totient is φ = 57829212628680.
The previous prime is 101201122099999. The next prime is 101201122100219. The reversal of 101201122100211 is 112001221102101.
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 101201122100211 - 29 = 101201122099699 is a prime.
It is a super-2 number, since 2×1012011221002112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (101201122100219) 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, 2409550526175 + ... + 2409550526216.
It is an arithmetic number, because the mean of its divisors is an integer number (19276404209568).
Almost surely, 2101201122100211 is an apocalyptic number.
101201122100211 is a deficient number, since it is larger than the sum of its proper divisors (53010111576333).
101201122100211 is an equidigital number, since it uses as much as digits as its factorization.
101201122100211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4819101052401.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 101201122100211 its reverse (112001221102101), we get a palindrome (213202343202312).
The spelling of 101201122100211 in words is "one hundred one trillion, two hundred one billion, one hundred twenty-two million, one hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •