Base | Representation |
---|---|
bin | 101101101111111111011011… |
… | …001111100111110011101111 |
3 | 222101102111012122012220022101 |
4 | 231233333123033213303233 |
5 | 202333111100333034411 |
6 | 1551534334133155531 |
7 | 60244641436066465 |
oct | 5557773317476357 |
9 | 871374178186271 |
10 | 201210011221231 |
11 | 591257608890a1 |
12 | 1a697a2178bba7 |
13 | 883703a99271c |
14 | 379888b992835 |
15 | 183de02b028c1 |
hex | b6ffdb3e7cef |
201210011221231 has 2 divisors, whose sum is σ = 201210011221232. Its totient is φ = 201210011221230.
The previous prime is 201210011221181. The next prime is 201210011221291. The reversal of 201210011221231 is 132122110012102.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 201210011221231 - 223 = 201210002832623 is a prime.
It is a super-2 number, since 2×2012100112212312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 201210011221199 and 201210011221208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201210011221291) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100605005610615 + 100605005610616.
It is an arithmetic number, because the mean of its divisors is an integer number (100605005610616).
Almost surely, 2201210011221231 is an apocalyptic number.
201210011221231 is a deficient number, since it is larger than the sum of its proper divisors (1).
201210011221231 is an equidigital number, since it uses as much as digits as its factorization.
201210011221231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 201210011221231 its reverse (132122110012102), we get a palindrome (333332121233333).
The spelling of 201210011221231 in words is "two hundred one trillion, two hundred ten billion, eleven million, two hundred twenty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •