Base | Representation |
---|---|
bin | 1111100001011… |
… | …01100011110001 |
3 | 100002000100120211 |
4 | 13300231203301 |
5 | 231313210113 |
6 | 20530504121 |
7 | 3140524042 |
oct | 760554361 |
9 | 302010524 |
10 | 130210033 |
11 | 675557a8 |
12 | 37735041 |
13 | 20c90275 |
14 | 134168c9 |
15 | b670b3d |
hex | 7c2d8f1 |
130210033 has 2 divisors, whose sum is σ = 130210034. Its totient is φ = 130210032.
The previous prime is 130209997. The next prime is 130210037. The reversal of 130210033 is 330012031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 127983969 + 2226064 = 11313^2 + 1492^2 .
It is an emirp because it is prime and its reverse (330012031) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130210033 is a prime.
It is a super-2 number, since 2×1302100332 = 33909305387722178, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 130209995 and 130210022.
It is not a weakly prime, because it can be changed into another prime (130210037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65105016 + 65105017.
It is an arithmetic number, because the mean of its divisors is an integer number (65105017).
Almost surely, 2130210033 is an apocalyptic number.
It is an amenable number.
130210033 is a deficient number, since it is larger than the sum of its proper divisors (1).
130210033 is an equidigital number, since it uses as much as digits as its factorization.
130210033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 13.
The square root of 130210033 is about 11410.9610901098. The cubic root of 130210033 is about 506.8523716676.
Adding to 130210033 its reverse (330012031), we get a palindrome (460222064).
The spelling of 130210033 in words is "one hundred thirty million, two hundred ten thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.135 sec. • engine limits •