Base | Representation |
---|---|
bin | 11101100011111010001101… |
… | …011100001010111001010001 |
3 | 122001022221012102120212201111 |
4 | 131203322031130022321101 |
5 | 114020100043423201113 |
6 | 1140302124413533321 |
7 | 36245662411640452 |
oct | 3543721534127121 |
9 | 561287172525644 |
10 | 130011033022033 |
11 | 3847540783aa59 |
12 | 126b9013aa4241 |
13 | 5770cac2a21a7 |
14 | 24167d35c7129 |
15 | 1006d42eac13d |
hex | 763e8d70ae51 |
130011033022033 has 2 divisors, whose sum is σ = 130011033022034. Its totient is φ = 130011033022032.
The previous prime is 130011033022009. The next prime is 130011033022049. The reversal of 130011033022033 is 330220330110031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 94319214628864 + 35691818393169 = 9711808^2 + 5974263^2 .
It is a cyclic number.
It is not a de Polignac number, because 130011033022033 - 29 = 130011033021521 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 130011033021995 and 130011033022013.
It is not a weakly prime, because it can be changed into another prime (130011033022133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65005516511016 + 65005516511017.
It is an arithmetic number, because the mean of its divisors is an integer number (65005516511017).
Almost surely, 2130011033022033 is an apocalyptic number.
It is an amenable number.
130011033022033 is a deficient number, since it is larger than the sum of its proper divisors (1).
130011033022033 is an equidigital number, since it uses as much as digits as its factorization.
130011033022033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 130011033022033 its reverse (330220330110031), we get a palindrome (460231363132064).
The spelling of 130011033022033 in words is "one hundred thirty trillion, eleven billion, thirty-three million, twenty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •