Base | Representation |
---|---|
bin | 110011010001010011… |
… | …0100011111010000001 |
3 | 101112012012201021022221 |
4 | 1212202212203322001 |
5 | 3300442130344222 |
6 | 122325200131041 |
7 | 10645302154312 |
oct | 1464246437201 |
9 | 345165637287 |
10 | 110102199937 |
11 | 4276a904474 |
12 | 19409006a81 |
13 | a4c8730b42 |
14 | 54869c8609 |
15 | 2ce60840c7 |
hex | 19a29a3e81 |
110102199937 has 2 divisors, whose sum is σ = 110102199938. Its totient is φ = 110102199936.
The previous prime is 110102199923. The next prime is 110102199959. The reversal of 110102199937 is 739991201011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 91585522161 + 18516677776 = 302631^2 + 136076^2 .
It is a cyclic number.
It is not a de Polignac number, because 110102199937 - 223 = 110093811329 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110102199893 and 110102199902.
It is not a weakly prime, because it can be changed into another prime (110102119937) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55051099968 + 55051099969.
It is an arithmetic number, because the mean of its divisors is an integer number (55051099969).
Almost surely, 2110102199937 is an apocalyptic number.
It is an amenable number.
110102199937 is a deficient number, since it is larger than the sum of its proper divisors (1).
110102199937 is an equidigital number, since it uses as much as digits as its factorization.
110102199937 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30618, while the sum is 43.
The spelling of 110102199937 in words is "one hundred ten billion, one hundred two million, one hundred ninety-nine thousand, nine hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •