Base | Representation |
---|---|
bin | 1001001001100100111111… |
… | …11100101111000011000001 |
3 | 2122020111001000112122202221 |
4 | 10210302133330233003001 |
5 | 10114122343420010103 |
6 | 110443050513411041 |
7 | 4144434021556231 |
oct | 444623774570301 |
9 | 78214030478687 |
10 | 20120310313153 |
11 | 6457a80700006 |
12 | 230b54b269a81 |
13 | b2c44c86a14b |
14 | 4d7b8489dcc1 |
15 | 24d5971d61bd |
hex | 124c9ff2f0c1 |
20120310313153 has 2 divisors, whose sum is σ = 20120310313154. Its totient is φ = 20120310313152.
The previous prime is 20120310313141. The next prime is 20120310313223. The reversal of 20120310313153 is 35131301302102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 18146304983104 + 1974005330049 = 4259848^2 + 1404993^2 .
It is a cyclic number.
It is not a de Polignac number, because 20120310313153 - 213 = 20120310304961 is a prime.
It is not a weakly prime, because it can be changed into another prime (20120310310153) 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, 10060155156576 + 10060155156577.
It is an arithmetic number, because the mean of its divisors is an integer number (10060155156577).
Almost surely, 220120310313153 is an apocalyptic number.
It is an amenable number.
20120310313153 is a deficient number, since it is larger than the sum of its proper divisors (1).
20120310313153 is an equidigital number, since it uses as much as digits as its factorization.
20120310313153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1620, while the sum is 25.
Adding to 20120310313153 its reverse (35131301302102), we get a palindrome (55251611615255).
The spelling of 20120310313153 in words is "twenty trillion, one hundred twenty billion, three hundred ten million, three hundred thirteen thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •