Base | Representation |
---|---|
bin | 110011001110100011… |
… | …0011110001111010001 |
3 | 101111221210001001102001 |
4 | 1212131012132033101 |
5 | 3300300013331113 |
6 | 122312101554001 |
7 | 10643101511233 |
oct | 1463506361721 |
9 | 344853031361 |
10 | 110009902033 |
11 | 427227a3709 |
12 | 193a2115901 |
13 | a4b2585cb5 |
14 | 5478640253 |
15 | 2cdce017dd |
hex | 199d19e3d1 |
110009902033 has 2 divisors, whose sum is σ = 110009902034. Its totient is φ = 110009902032.
The previous prime is 110009901983. The next prime is 110009902061. The reversal of 110009902033 is 330209900011.
It is an a-pointer prime, because the next prime (110009902061) can be obtained adding 110009902033 to its sum of digits (28).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 89393824144 + 20616077889 = 298988^2 + 143583^2 .
It is an emirp because it is prime and its reverse (330209900011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110009902033 - 225 = 109976347601 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110009901992 and 110009902010.
It is not a weakly prime, because it can be changed into another prime (110009902073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55004951016 + 55004951017.
It is an arithmetic number, because the mean of its divisors is an integer number (55004951017).
Almost surely, 2110009902033 is an apocalyptic number.
It is an amenable number.
110009902033 is a deficient number, since it is larger than the sum of its proper divisors (1).
110009902033 is an equidigital number, since it uses as much as digits as its factorization.
110009902033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1458, while the sum is 28.
The spelling of 110009902033 in words is "one hundred ten billion, nine million, nine hundred two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •