Base | Representation |
---|---|
bin | 110011001110100011… |
… | …0011000101000111011 |
3 | 101111221202222212221122 |
4 | 1212131012120220323 |
5 | 3300300012112344 |
6 | 122312101255455 |
7 | 10643101354331 |
oct | 1463506305073 |
9 | 344852885848 |
10 | 110009879099 |
11 | 4272278845a |
12 | 193a210458b |
13 | a4b2578723 |
14 | 5478635b51 |
15 | 2cdcde9aee |
hex | 199d198a3b |
110009879099 has 2 divisors, whose sum is σ = 110009879100. Its totient is φ = 110009879098.
The previous prime is 110009879093. The next prime is 110009879117. The reversal of 110009879099 is 990978900011.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110009879099 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110009879099.
It is not a weakly prime, because it can be changed into another prime (110009879093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55004939549 + 55004939550.
It is an arithmetic number, because the mean of its divisors is an integer number (55004939550).
Almost surely, 2110009879099 is an apocalyptic number.
110009879099 is a deficient number, since it is larger than the sum of its proper divisors (1).
110009879099 is an equidigital number, since it uses as much as digits as its factorization.
110009879099 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 367416, while the sum is 53.
The spelling of 110009879099 in words is "one hundred ten billion, nine million, eight hundred seventy-nine thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •