Base | Representation |
---|---|
bin | 1001010010000010100010… |
… | …1000100111111010111101 |
3 | 1100010122020111221220022111 |
4 | 2110200220220213322331 |
5 | 2314201403123030323 |
6 | 33412204130214021 |
7 | 2102216253660355 |
oct | 224405050477275 |
9 | 40118214856274 |
10 | 10205524033213 |
11 | 3285158294123 |
12 | 1189a95424311 |
13 | 5904b8a544b2 |
14 | 273d42b21b65 |
15 | 12a708332c0d |
hex | 94828a27ebd |
10205524033213 has 2 divisors, whose sum is σ = 10205524033214. Its totient is φ = 10205524033212.
The previous prime is 10205524033189. The next prime is 10205524033217. The reversal of 10205524033213 is 31233042550201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7504191826884 + 2701332206329 = 2739378^2 + 1643573^2 .
It is an emirp because it is prime and its reverse (31233042550201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10205524033213 - 217 = 10205523902141 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10205524033217) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5102762016606 + 5102762016607.
It is an arithmetic number, because the mean of its divisors is an integer number (5102762016607).
Almost surely, 210205524033213 is an apocalyptic number.
It is an amenable number.
10205524033213 is a deficient number, since it is larger than the sum of its proper divisors (1).
10205524033213 is an equidigital number, since it uses as much as digits as its factorization.
10205524033213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21600, while the sum is 31.
Adding to 10205524033213 its reverse (31233042550201), we get a palindrome (41438566583414).
The spelling of 10205524033213 in words is "ten trillion, two hundred five billion, five hundred twenty-four million, thirty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •