Base | Representation |
---|---|
bin | 1001010010011011100001… |
… | …1010011101011000001101 |
3 | 1100011021112221200121020201 |
4 | 2110212320122131120031 |
5 | 2314304122142101123 |
6 | 33415233444213501 |
7 | 2102544416004235 |
oct | 224467032353015 |
9 | 40137487617221 |
10 | 10212231206413 |
11 | 3287a8a313675 |
12 | 118b24769a291 |
13 | 5910174a1632 |
14 | 2743bb814cc5 |
15 | 12a99c0a85ad |
hex | 949b869d60d |
10212231206413 has 2 divisors, whose sum is σ = 10212231206414. Its totient is φ = 10212231206412.
The previous prime is 10212231206399. The next prime is 10212231206417. The reversal of 10212231206413 is 31460213221201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10126918727524 + 85312478889 = 3182282^2 + 292083^2 .
It is an emirp because it is prime and its reverse (31460213221201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10212231206413 - 29 = 10212231205901 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10212231206417) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5106115603206 + 5106115603207.
It is an arithmetic number, because the mean of its divisors is an integer number (5106115603207).
Almost surely, 210212231206413 is an apocalyptic number.
It is an amenable number.
10212231206413 is a deficient number, since it is larger than the sum of its proper divisors (1).
10212231206413 is an equidigital number, since it uses as much as digits as its factorization.
10212231206413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 28.
Adding to 10212231206413 its reverse (31460213221201), we get a palindrome (41672444427614).
The spelling of 10212231206413 in words is "ten trillion, two hundred twelve billion, two hundred thirty-one million, two hundred six thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •