Base | Representation |
---|---|
bin | 1001001001011101010110… |
… | …10100111010001011111001 |
3 | 2122020002102222222202020212 |
4 | 10210232223110322023321 |
5 | 10114040442243413223 |
6 | 110441131345000505 |
7 | 4144230225503042 |
oct | 444565324721371 |
9 | 78202388882225 |
10 | 20116206232313 |
11 | 6456264a98364 |
12 | 230a7a4923135 |
13 | b2bc47506649 |
14 | 4d78b57b58c9 |
15 | 24d406c52278 |
hex | 124bab53a2f9 |
20116206232313 has 2 divisors, whose sum is σ = 20116206232314. Its totient is φ = 20116206232312.
The previous prime is 20116206232289. The next prime is 20116206232319. The reversal of 20116206232313 is 31323260261102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12912581054464 + 7203625177849 = 3593408^2 + 2683957^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20116206232313 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20116206232313.
It is not a weakly prime, because it can be changed into another prime (20116206232319) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10058103116156 + 10058103116157.
It is an arithmetic number, because the mean of its divisors is an integer number (10058103116157).
Almost surely, 220116206232313 is an apocalyptic number.
It is an amenable number.
20116206232313 is a deficient number, since it is larger than the sum of its proper divisors (1).
20116206232313 is an equidigital number, since it uses as much as digits as its factorization.
20116206232313 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 15552, while the sum is 32.
Adding to 20116206232313 its reverse (31323260261102), we get a palindrome (51439466493415).
The spelling of 20116206232313 in words is "twenty trillion, one hundred sixteen billion, two hundred six million, two hundred thirty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •