Base | Representation |
---|---|
bin | 1001001001111001100000… |
… | …01100100111101111011111 |
3 | 2122021112110022211112020021 |
4 | 10210330300030213233133 |
5 | 10114312421001044411 |
6 | 110452111220333011 |
7 | 4145303612305264 |
oct | 444746014475737 |
9 | 78245408745207 |
10 | 20131320331231 |
11 | 64617105605aa |
12 | 2311702544167 |
13 | b304b5891645 |
14 | 4d850ac1b26b |
15 | 24d9ddaa3a71 |
hex | 124f30327bdf |
20131320331231 has 2 divisors, whose sum is σ = 20131320331232. Its totient is φ = 20131320331230.
The previous prime is 20131320331211. The next prime is 20131320331247. The reversal of 20131320331231 is 13213302313102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20131320331231 - 27 = 20131320331103 is a prime.
It is a super-2 number, since 2×201313203312312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20131320331196 and 20131320331205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20131320331211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10065660165615 + 10065660165616.
It is an arithmetic number, because the mean of its divisors is an integer number (10065660165616).
Almost surely, 220131320331231 is an apocalyptic number.
20131320331231 is a deficient number, since it is larger than the sum of its proper divisors (1).
20131320331231 is an equidigital number, since it uses as much as digits as its factorization.
20131320331231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 20131320331231 its reverse (13213302313102), we get a palindrome (33344622644333).
The spelling of 20131320331231 in words is "twenty trillion, one hundred thirty-one billion, three hundred twenty million, three hundred thirty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •