Base | Representation |
---|---|
bin | 11001000000010000… |
… | …11111110101001101 |
3 | 1021122112121212120112 |
4 | 30200020133311031 |
5 | 204443021002313 |
6 | 10100014525405 |
7 | 653442056132 |
oct | 144010376515 |
9 | 37575555515 |
10 | 13424000333 |
11 | 5769553157 |
12 | 2727806865 |
13 | 135c197483 |
14 | 914bba589 |
15 | 5387a68a8 |
hex | 32021fd4d |
13424000333 has 2 divisors, whose sum is σ = 13424000334. Its totient is φ = 13424000332.
The previous prime is 13424000299. The next prime is 13424000341. The reversal of 13424000333 is 33300042431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12122450404 + 1301549929 = 110102^2 + 36077^2 .
It is a cyclic number.
It is not a de Polignac number, because 13424000333 - 28 = 13424000077 is a prime.
It is a super-2 number, since 2×134240003332 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 13424000299 and 13424000308.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13424000533) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6712000166 + 6712000167.
It is an arithmetic number, because the mean of its divisors is an integer number (6712000167).
Almost surely, 213424000333 is an apocalyptic number.
It is an amenable number.
13424000333 is a deficient number, since it is larger than the sum of its proper divisors (1).
13424000333 is an equidigital number, since it uses as much as digits as its factorization.
13424000333 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2592, while the sum is 23.
Adding to 13424000333 its reverse (33300042431), we get a palindrome (46724042764).
The spelling of 13424000333 in words is "thirteen billion, four hundred twenty-four million, three hundred thirty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •