Base | Representation |
---|---|
bin | 1001001001111101000000… |
… | …10011001100100101111111 |
3 | 2122021201022101211122101111 |
4 | 10210332200103030211333 |
5 | 10114330243440300411 |
6 | 110453022004022451 |
7 | 4145401330512466 |
oct | 444764023144577 |
9 | 78251271748344 |
10 | 20133201103231 |
11 | 6462496173427 |
12 | 2311b48391a27 |
13 | b30725422298 |
14 | 4d864891b9dd |
15 | 24da9dc64721 |
hex | 124fa04cc97f |
20133201103231 has 2 divisors, whose sum is σ = 20133201103232. Its totient is φ = 20133201103230.
The previous prime is 20133201103229. The next prime is 20133201103247. The reversal of 20133201103231 is 13230110233102.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 20133201103231 - 21 = 20133201103229 is a prime.
It is a super-2 number, since 2×201332011032312 (a number of 27 digits) contains 22 as substring.
Together with 20133201103229, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20133201103531) 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, 10066600551615 + 10066600551616.
It is an arithmetic number, because the mean of its divisors is an integer number (10066600551616).
Almost surely, 220133201103231 is an apocalyptic number.
20133201103231 is a deficient number, since it is larger than the sum of its proper divisors (1).
20133201103231 is an equidigital number, since it uses as much as digits as its factorization.
20133201103231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 20133201103231 its reverse (13230110233102), we get a palindrome (33363311336333).
The spelling of 20133201103231 in words is "twenty trillion, one hundred thirty-three billion, two hundred one million, one hundred three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •