Base | Representation |
---|---|
bin | 10110110001111101… |
… | …00011000111110001 |
3 | 1011120100022001010222 |
4 | 23120332203013301 |
5 | 200021413210113 |
6 | 5341331502425 |
7 | 612035033006 |
oct | 133076430761 |
9 | 34510261128 |
10 | 12230210033 |
11 | 52066a88a8 |
12 | 2453a57a15 |
13 | 11cba68592 |
14 | 8404258ad |
15 | 4b8a95e08 |
hex | 2d8fa31f1 |
12230210033 has 2 divisors, whose sum is σ = 12230210034. Its totient is φ = 12230210032.
The previous prime is 12230209939. The next prime is 12230210051. The reversal of 12230210033 is 33001203221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10839516769 + 1390693264 = 104113^2 + 37292^2 .
It is a cyclic number.
It is not a de Polignac number, because 12230210033 - 216 = 12230144497 is a prime.
It is a super-2 number, since 2×122302100332 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12230209993 and 12230210020.
It is not a weakly prime, because it can be changed into another prime (12230210063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6115105016 + 6115105017.
It is an arithmetic number, because the mean of its divisors is an integer number (6115105017).
Almost surely, 212230210033 is an apocalyptic number.
It is an amenable number.
12230210033 is a deficient number, since it is larger than the sum of its proper divisors (1).
12230210033 is an equidigital number, since it uses as much as digits as its factorization.
12230210033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 12230210033 its reverse (33001203221), we get a palindrome (45231413254).
The spelling of 12230210033 in words is "twelve billion, two hundred thirty million, two hundred ten thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •