Base | Representation |
---|---|
bin | 1001010010011011011010… |
… | …0111001110110100100101 |
3 | 1100011021110211211222011011 |
4 | 2110212312213032310211 |
5 | 2314304041424001404 |
6 | 33415230444542221 |
7 | 2102543601156454 |
oct | 224466647166445 |
9 | 40137424758134 |
10 | 10212201000229 |
11 | 3287a74262288 |
12 | 118b239551971 |
13 | 591011156857 |
14 | 2743b77d0b9b |
15 | 12a9995dd604 |
hex | 949b69ced25 |
10212201000229 has 2 divisors, whose sum is σ = 10212201000230. Its totient is φ = 10212201000228.
The previous prime is 10212201000179. The next prime is 10212201000241. The reversal of 10212201000229 is 92200010221201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9686423739204 + 525777261025 = 3112302^2 + 725105^2 .
It is an emirp because it is prime and its reverse (92200010221201) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10212201000229 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10212201000269) 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 as a sum of consecutive naturals, namely, 5106100500114 + 5106100500115.
It is an arithmetic number, because the mean of its divisors is an integer number (5106100500115).
Almost surely, 210212201000229 is an apocalyptic number.
It is an amenable number.
10212201000229 is a deficient number, since it is larger than the sum of its proper divisors (1).
10212201000229 is an equidigital number, since it uses as much as digits as its factorization.
10212201000229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 22.
The spelling of 10212201000229 in words is "ten trillion, two hundred twelve billion, two hundred one million, two hundred twenty-nine", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •