Base | Representation |
---|---|
bin | 11000011010110101… |
… | …11011010100110001 |
3 | 1020211122220021110222 |
4 | 30031122323110301 |
5 | 203322134030213 |
6 | 10004522102425 |
7 | 642610465124 |
oct | 141532732461 |
9 | 36748807428 |
10 | 13110064433 |
11 | 56183204a4 |
12 | 265a64aa15 |
13 | 130c12a49b |
14 | 8c521a3bb |
15 | 51ae43808 |
hex | 30d6bb531 |
13110064433 has 2 divisors, whose sum is σ = 13110064434. Its totient is φ = 13110064432.
The previous prime is 13110064399. The next prime is 13110064439. The reversal of 13110064433 is 33446001131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13046893729 + 63170704 = 114223^2 + 7948^2 .
It is a cyclic number.
It is not a de Polignac number, because 13110064433 - 210 = 13110063409 is a prime.
It is a super-2 number, since 2×131100644332 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (13110064439) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6555032216 + 6555032217.
It is an arithmetic number, because the mean of its divisors is an integer number (6555032217).
Almost surely, 213110064433 is an apocalyptic number.
It is an amenable number.
13110064433 is a deficient number, since it is larger than the sum of its proper divisors (1).
13110064433 is an equidigital number, since it uses as much as digits as its factorization.
13110064433 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 26.
Adding to 13110064433 its reverse (33446001131), we get a palindrome (46556065564).
The spelling of 13110064433 in words is "thirteen billion, one hundred ten million, sixty-four thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •