Base | Representation |
---|---|
bin | 110011001110100011… |
… | …0111110001101110101 |
3 | 101111221210021201002011 |
4 | 1212131012332031311 |
5 | 3300300032024023 |
6 | 122312104444221 |
7 | 10643102565136 |
oct | 1463506761565 |
9 | 344853251064 |
10 | 110010033013 |
11 | 42722883061 |
12 | 193a2179671 |
13 | a4b26007ba |
14 | 5478675c8d |
15 | 2cdce2a50d |
hex | 199d1be375 |
110010033013 has 2 divisors, whose sum is σ = 110010033014. Its totient is φ = 110010033012.
The previous prime is 110010032989. The next prime is 110010033031. The reversal of 110010033013 is 310330010011.
It is a happy number.
Together with next prime (110010033031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 97392678084 + 12617354929 = 312078^2 + 112327^2 .
It is a cyclic number.
It is not a de Polignac number, because 110010033013 - 29 = 110010032501 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110010032984 and 110010033002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110010033313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55005016506 + 55005016507.
It is an arithmetic number, because the mean of its divisors is an integer number (55005016507).
Almost surely, 2110010033013 is an apocalyptic number.
It is an amenable number.
110010033013 is a deficient number, since it is larger than the sum of its proper divisors (1).
110010033013 is an equidigital number, since it uses as much as digits as its factorization.
110010033013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 27, while the sum is 13.
Adding to 110010033013 its reverse (310330010011), we get a palindrome (420340043024).
The spelling of 110010033013 in words is "one hundred ten billion, ten million, thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •