Base | Representation |
---|---|
bin | 11001000010001010101101… |
… | …010110011010110100001111 |
3 | 112102211110121021100200222222 |
4 | 121002022231112122310033 |
5 | 103412340001100013124 |
6 | 1030055142050125555 |
7 | 32122320054503351 |
oct | 3102125526326417 |
9 | 472743537320888 |
10 | 110100100001039 |
11 | 32099210168585 |
12 | 104221788808bb |
13 | 4958519724cc5 |
14 | 1d28c323930d1 |
15 | cade5260225e |
hex | 6422ad59ad0f |
110100100001039 has 2 divisors, whose sum is σ = 110100100001040. Its totient is φ = 110100100001038.
The previous prime is 110100100001009. The next prime is 110100100001071. The reversal of 110100100001039 is 930100001001011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110100100001039 - 220 = 110100098952463 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110100100001009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55050050000519 + 55050050000520.
It is an arithmetic number, because the mean of its divisors is an integer number (55050050000520).
Almost surely, 2110100100001039 is an apocalyptic number.
110100100001039 is a deficient number, since it is larger than the sum of its proper divisors (1).
110100100001039 is an equidigital number, since it uses as much as digits as its factorization.
110100100001039 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27, while the sum is 17.
The spelling of 110100100001039 in words is "one hundred ten trillion, one hundred billion, one hundred million, one thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •