Base | Representation |
---|---|
bin | 110011011010001111… |
… | …0101111111100000111 |
3 | 101112222010002220102201 |
4 | 1212310132233330013 |
5 | 3302100422020314 |
6 | 122415033015331 |
7 | 10655603502664 |
oct | 1466436577407 |
9 | 345863086381 |
10 | 110402141959 |
11 | 4290414933a |
12 | 19491554547 |
13 | a54590b425 |
14 | 54b4784a6b |
15 | 2d12580b74 |
hex | 19b47aff07 |
110402141959 has 2 divisors, whose sum is σ = 110402141960. Its totient is φ = 110402141958.
The previous prime is 110402141917. The next prime is 110402142017. The reversal of 110402141959 is 959141204011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110402141959 - 231 = 108254658311 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110402141909) 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, 55201070979 + 55201070980.
It is an arithmetic number, because the mean of its divisors is an integer number (55201070980).
Almost surely, 2110402141959 is an apocalyptic number.
110402141959 is a deficient number, since it is larger than the sum of its proper divisors (1).
110402141959 is an equidigital number, since it uses as much as digits as its factorization.
110402141959 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12960, while the sum is 37.
The spelling of 110402141959 in words is "one hundred ten billion, four hundred two million, one hundred forty-one thousand, nine hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •