Base | Representation |
---|---|
bin | 1001001001111001101100… |
… | …01000111010010100010001 |
3 | 2122021112201021102100022012 |
4 | 10210330312020322110101 |
5 | 10114313122011201113 |
6 | 110452125141152305 |
7 | 4145306232542105 |
oct | 444746610722421 |
9 | 78245637370265 |
10 | 20131420022033 |
11 | 64617618607a1 |
12 | 231172b9bb695 |
13 | b30500427498 |
14 | 4d851a16b905 |
15 | 24d9e76e6aa8 |
hex | 124f3623a511 |
20131420022033 has 2 divisors, whose sum is σ = 20131420022034. Its totient is φ = 20131420022032.
The previous prime is 20131420022029. The next prime is 20131420022053. The reversal of 20131420022033 is 33022002413102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12537774520384 + 7593645501649 = 3540872^2 + 2755657^2 .
It is a cyclic number.
It is not a de Polignac number, because 20131420022033 - 22 = 20131420022029 is a prime.
It is a super-2 number, since 2×201314200220332 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20131420022053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10065710011016 + 10065710011017.
It is an arithmetic number, because the mean of its divisors is an integer number (10065710011017).
Almost surely, 220131420022033 is an apocalyptic number.
It is an amenable number.
20131420022033 is a deficient number, since it is larger than the sum of its proper divisors (1).
20131420022033 is an equidigital number, since it uses as much as digits as its factorization.
20131420022033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 20131420022033 its reverse (33022002413102), we get a palindrome (53153422435135).
The spelling of 20131420022033 in words is "twenty trillion, one hundred thirty-one billion, four hundred twenty million, twenty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •