Base | Representation |
---|---|
bin | 110011011010001111… |
… | …1111000111110001101 |
3 | 101112222010200002210001 |
4 | 1212310133320332031 |
5 | 3302101011103401 |
6 | 122415043244301 |
7 | 10655606160061 |
oct | 1466437707615 |
9 | 345863602701 |
10 | 110402441101 |
11 | 42904333067 |
12 | 19491679691 |
13 | a5459b4634 |
14 | 54b4821aa1 |
15 | 2d125de601 |
hex | 19b47f8f8d |
110402441101 has 2 divisors, whose sum is σ = 110402441102. Its totient is φ = 110402441100.
The previous prime is 110402441081. The next prime is 110402441153. The reversal of 110402441101 is 101144204011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 107404331076 + 2998110025 = 327726^2 + 54755^2 .
It is an emirp because it is prime and its reverse (101144204011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110402441101 - 213 = 110402432909 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110402451101) 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, 55201220550 + 55201220551.
It is an arithmetic number, because the mean of its divisors is an integer number (55201220551).
Almost surely, 2110402441101 is an apocalyptic number.
It is an amenable number.
110402441101 is a deficient number, since it is larger than the sum of its proper divisors (1).
110402441101 is an equidigital number, since it uses as much as digits as its factorization.
110402441101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 110402441101 its reverse (101144204011), we get a palindrome (211546645112).
The spelling of 110402441101 in words is "one hundred ten billion, four hundred two million, four hundred forty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •