Base | Representation |
---|---|
bin | 11101100100000100011100… |
… | …000001110110111100001001 |
3 | 122001100222112210111101010212 |
4 | 131210010130001312330021 |
5 | 114020240041342413113 |
6 | 1140311142244050505 |
7 | 36246531513631154 |
oct | 3544043401667411 |
9 | 561328483441125 |
10 | 130022015201033 |
11 | 3847a032a0664a |
12 | 126bb179993a35 |
13 | 577203c5ca167 |
14 | 2417155d78c9b |
15 | 10072871cb0a8 |
hex | 76411c076f09 |
130022015201033 has 2 divisors, whose sum is σ = 130022015201034. Its totient is φ = 130022015201032.
The previous prime is 130022015201003. The next prime is 130022015201159. The reversal of 130022015201033 is 330102510220031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 79151413237264 + 50870601963769 = 8896708^2 + 7132363^2 .
It is an emirp because it is prime and its reverse (330102510220031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 130022015201033 - 218 = 130022014938889 is a prime.
It is not a weakly prime, because it can be changed into another prime (130022015201003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65011007600516 + 65011007600517.
It is an arithmetic number, because the mean of its divisors is an integer number (65011007600517).
Almost surely, 2130022015201033 is an apocalyptic number.
It is an amenable number.
130022015201033 is a deficient number, since it is larger than the sum of its proper divisors (1).
130022015201033 is an equidigital number, since it uses as much as digits as its factorization.
130022015201033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080, while the sum is 23.
Adding to 130022015201033 its reverse (330102510220031), we get a palindrome (460124525421064).
The spelling of 130022015201033 in words is "one hundred thirty trillion, twenty-two billion, fifteen million, two hundred one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •