Base | Representation |
---|---|
bin | 1001001001100110111000… |
… | …01001101001001111110111 |
3 | 2122020120122102001211201212 |
4 | 10210303130021221033313 |
5 | 10114131431001031411 |
6 | 110443335033512035 |
7 | 4144501034560361 |
oct | 444633411511767 |
9 | 78216572054655 |
10 | 20121320330231 |
11 | 645844984586a |
12 | 230b79157261b |
13 | b2c580ba38a3 |
14 | 4d7c3ca97d31 |
15 | 24d605be568b |
hex | 124cdc2693f7 |
20121320330231 has 2 divisors, whose sum is σ = 20121320330232. Its totient is φ = 20121320330230.
The previous prime is 20121320330143. The next prime is 20121320330239. The reversal of 20121320330231 is 13203302312102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20121320330231 - 234 = 20104140461047 is a prime.
It is a super-2 number, since 2×201213203302312 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 20121320330197 and 20121320330206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20121320330239) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10060660165115 + 10060660165116.
It is an arithmetic number, because the mean of its divisors is an integer number (10060660165116).
Almost surely, 220121320330231 is an apocalyptic number.
20121320330231 is a deficient number, since it is larger than the sum of its proper divisors (1).
20121320330231 is an equidigital number, since it uses as much as digits as its factorization.
20121320330231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 20121320330231 its reverse (13203302312102), we get a palindrome (33324622642333).
The spelling of 20121320330231 in words is "twenty trillion, one hundred twenty-one billion, three hundred twenty million, three hundred thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.133 sec. • engine limits •