Base | Representation |
---|---|
bin | 11001000010001101011010… |
… | …011001101111111001111011 |
3 | 112102211202002121111012122102 |
4 | 121002031122121233321323 |
5 | 103412411422323112334 |
6 | 1030100342122414015 |
7 | 32122452030426632 |
oct | 3102153231577173 |
9 | 472752077435572 |
10 | 110103003332219 |
11 | 3209a470002237 |
12 | 1042284906130b |
13 | 4958890091051 |
14 | 1d29029bd4519 |
15 | cae07244d67e |
hex | 64235a66fe7b |
110103003332219 has 2 divisors, whose sum is σ = 110103003332220. Its totient is φ = 110103003332218.
The previous prime is 110103003332197. The next prime is 110103003332221. The reversal of 110103003332219 is 912233300301011.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110103003332219 is a prime.
It is a super-2 number, since 2×1101030033322192 (a number of 29 digits) contains 22 as substring.
Together with 110103003332221, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 110103003332191 and 110103003332200.
It is not a weakly prime, because it can be changed into another prime (110103003332249) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55051501666109 + 55051501666110.
It is an arithmetic number, because the mean of its divisors is an integer number (55051501666110).
Almost surely, 2110103003332219 is an apocalyptic number.
110103003332219 is a deficient number, since it is larger than the sum of its proper divisors (1).
110103003332219 is an equidigital number, since it uses as much as digits as its factorization.
110103003332219 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916, while the sum is 29.
The spelling of 110103003332219 in words is "one hundred ten trillion, one hundred three billion, three million, three hundred thirty-two thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •