Base | Representation |
---|---|
bin | 11110000000110000110… |
… | …00000001000110110011 |
3 | 10122120201011210112121011 |
4 | 33000120120001012303 |
5 | 113343344440201321 |
6 | 2105421030211351 |
7 | 134334060504532 |
oct | 17003030010663 |
9 | 3576634715534 |
10 | 1031201100211 |
11 | 36836a157327 |
12 | 147a2b1b3b57 |
13 | 7631b44bb09 |
14 | 37ca61ca319 |
15 | 1bc55a46ae1 |
hex | f0186011b3 |
1031201100211 has 2 divisors, whose sum is σ = 1031201100212. Its totient is φ = 1031201100210.
The previous prime is 1031201100101. The next prime is 1031201100271. The reversal of 1031201100211 is 1120011021301.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1031201100211 - 29 = 1031201099699 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1031201100191 and 1031201100200.
It is not a weakly prime, because it can be changed into another prime (1031201100271) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 515600550105 + 515600550106.
It is an arithmetic number, because the mean of its divisors is an integer number (515600550106).
Almost surely, 21031201100211 is an apocalyptic number.
1031201100211 is a deficient number, since it is larger than the sum of its proper divisors (1).
1031201100211 is an equidigital number, since it uses as much as digits as its factorization.
1031201100211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 1031201100211 its reverse (1120011021301), we get a palindrome (2151212121512).
The spelling of 1031201100211 in words is "one trillion, thirty-one billion, two hundred one million, one hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •