Base | Representation |
---|---|
bin | 1111000011011011001100… |
… | …11110000111001011001101 |
3 | 11100012121201020002000220011 |
4 | 13201231212132013023031 |
5 | 13314330002210320023 |
6 | 154223153434353221 |
7 | 6654420665252662 |
oct | 741554636071315 |
9 | 140177636060804 |
10 | 33103032120013 |
11 | a602a0a701539 |
12 | 386770a58b811 |
13 | 15617aa9cb02b |
14 | 8262a3caba69 |
15 | 3c6144a4350d |
hex | 1e1b667872cd |
33103032120013 has 2 divisors, whose sum is σ = 33103032120014. Its totient is φ = 33103032120012.
The previous prime is 33103032119953. The next prime is 33103032120043. The reversal of 33103032120013 is 31002123030133.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 31494566448004 + 1608465672009 = 5612002^2 + 1268253^2 .
It is a cyclic number.
It is not a de Polignac number, because 33103032120013 - 29 = 33103032119501 is a prime.
It is a super-2 number, since 2×331030321200132 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (33103032120043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16551516060006 + 16551516060007.
It is an arithmetic number, because the mean of its divisors is an integer number (16551516060007).
Almost surely, 233103032120013 is an apocalyptic number.
It is an amenable number.
33103032120013 is a deficient number, since it is larger than the sum of its proper divisors (1).
33103032120013 is an equidigital number, since it uses as much as digits as its factorization.
33103032120013 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 33103032120013 its reverse (31002123030133), we get a palindrome (64105155150146).
The spelling of 33103032120013 in words is "thirty-three trillion, one hundred three billion, thirty-two million, one hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •