Base | Representation |
---|---|
bin | 10111010110000011… |
… | …01011010110000001 |
3 | 1012100110002101101011 |
4 | 23223001223112001 |
5 | 201131423120113 |
6 | 5431350040521 |
7 | 622402625002 |
oct | 135301532601 |
9 | 35313071334 |
10 | 12533020033 |
11 | 53516214a6 |
12 | 2519349141 |
13 | 124970b3b1 |
14 | 86c72b1a9 |
15 | 4d545c63d |
hex | 2eb06b581 |
12533020033 has 2 divisors, whose sum is σ = 12533020034. Its totient is φ = 12533020032.
The previous prime is 12533019979. The next prime is 12533020063. The reversal of 12533020033 is 33002033521.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11593474929 + 939545104 = 107673^2 + 30652^2 .
It is an emirp because it is prime and its reverse (33002033521) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12533020033 - 217 = 12532888961 is a prime.
It is a super-2 number, since 2×125330200332 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12533019986 and 12533020013.
It is not a weakly prime, because it can be changed into another prime (12533020063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6266510016 + 6266510017.
It is an arithmetic number, because the mean of its divisors is an integer number (6266510017).
Almost surely, 212533020033 is an apocalyptic number.
It is an amenable number.
12533020033 is a deficient number, since it is larger than the sum of its proper divisors (1).
12533020033 is an equidigital number, since it uses as much as digits as its factorization.
12533020033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1620, while the sum is 22.
Adding to 12533020033 its reverse (33002033521), we get a palindrome (45535053554).
The spelling of 12533020033 in words is "twelve billion, five hundred thirty-three million, twenty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •