Base | Representation |
---|---|
bin | 1001010001111110000111… |
… | …0110010010010001111101 |
3 | 1100010112011202021112001202 |
4 | 2110133201312102101331 |
5 | 2314141440111313003 |
6 | 33411450223545245 |
7 | 2102144653353035 |
oct | 224374166222175 |
9 | 40115152245052 |
10 | 10204336432253 |
11 | 32846a8986a27 |
12 | 118980375b225 |
13 | 5903599b1832 |
14 | 273c6d0dc8c5 |
15 | 12a688e46088 |
hex | 947e1d9247d |
10204336432253 has 2 divisors, whose sum is σ = 10204336432254. Its totient is φ = 10204336432252.
The previous prime is 10204336432231. The next prime is 10204336432289. The reversal of 10204336432253 is 35223463340201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7520905850329 + 2683430581924 = 2742427^2 + 1638118^2 .
It is a cyclic number.
It is not a de Polignac number, because 10204336432253 - 214 = 10204336415869 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10204336432753) 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, 5102168216126 + 5102168216127.
It is an arithmetic number, because the mean of its divisors is an integer number (5102168216127).
Almost surely, 210204336432253 is an apocalyptic number.
It is an amenable number.
10204336432253 is a deficient number, since it is larger than the sum of its proper divisors (1).
10204336432253 is an equidigital number, since it uses as much as digits as its factorization.
10204336432253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 311040, while the sum is 38.
Adding to 10204336432253 its reverse (35223463340201), we get a palindrome (45427799772454).
The spelling of 10204336432253 in words is "ten trillion, two hundred four billion, three hundred thirty-six million, four hundred thirty-two thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •