Base | Representation |
---|---|
bin | 110011010001001111… |
… | …1011000111100100111 |
3 | 101112012002011202121002 |
4 | 1212202133120330213 |
5 | 3300441140220124 |
6 | 122325051543515 |
7 | 10645250164463 |
oct | 1464237307447 |
9 | 345162152532 |
10 | 110100320039 |
11 | 42769840036 |
12 | 1940845ab9b |
13 | a4c8223288 |
14 | 54866594a3 |
15 | 2ce5d120ae |
hex | 19a27d8f27 |
110100320039 has 2 divisors, whose sum is σ = 110100320040. Its totient is φ = 110100320038.
The previous prime is 110100320017. The next prime is 110100320059. The reversal of 110100320039 is 930023001011.
It is an a-pointer prime, because the next prime (110100320059) can be obtained adding 110100320039 to its sum of digits (20).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110100320039 - 228 = 109831884583 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110100320039.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110100320009) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55050160019 + 55050160020.
It is an arithmetic number, because the mean of its divisors is an integer number (55050160020).
Almost surely, 2110100320039 is an apocalyptic number.
110100320039 is a deficient number, since it is larger than the sum of its proper divisors (1).
110100320039 is an equidigital number, since it uses as much as digits as its factorization.
110100320039 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 20.
The spelling of 110100320039 in words is "one hundred ten billion, one hundred million, three hundred twenty thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •