Base | Representation |
---|---|
bin | 1001001001111011000001… |
… | …00001111011010111111001 |
3 | 2122021121112211200002122222 |
4 | 10210331200201323113321 |
5 | 10114321101043114113 |
6 | 110452323504453425 |
7 | 4145332656624314 |
oct | 444754041732771 |
9 | 78247484602588 |
10 | 20132131223033 |
11 | 6461a97260615 |
12 | 23118aa01a275 |
13 | b305b4888c8b |
14 | 4d85867bd97b |
15 | 24da39d7ce08 |
hex | 124f6087b5f9 |
20132131223033 has 2 divisors, whose sum is σ = 20132131223034. Its totient is φ = 20132131223032.
The previous prime is 20132131222997. The next prime is 20132131223041. The reversal of 20132131223033 is 33032213123102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19935126625129 + 197004597904 = 4464877^2 + 443852^2 .
It is a cyclic number.
It is not a de Polignac number, because 20132131223033 - 26 = 20132131222969 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20132131222993 and 20132131223011.
It is not a weakly prime, because it can be changed into another prime (20132131223053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10066065611516 + 10066065611517.
It is an arithmetic number, because the mean of its divisors is an integer number (10066065611517).
Almost surely, 220132131223033 is an apocalyptic number.
It is an amenable number.
20132131223033 is a deficient number, since it is larger than the sum of its proper divisors (1).
20132131223033 is an equidigital number, since it uses as much as digits as its factorization.
20132131223033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 20132131223033 its reverse (33032213123102), we get a palindrome (53164344346135).
The spelling of 20132131223033 in words is "twenty trillion, one hundred thirty-two billion, one hundred thirty-one million, two hundred twenty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •