Base | Representation |
---|---|
bin | 110011011010001111… |
… | …0001110010110111101 |
3 | 101112222002211220202102 |
4 | 1212310132032112331 |
5 | 3302100403120123 |
6 | 122415030034445 |
7 | 10655602360661 |
oct | 1466436162675 |
9 | 345862756672 |
10 | 110402004413 |
11 | 42904064a68 |
12 | 194914a8a25 |
13 | a54589093c |
14 | 54b474a8a1 |
15 | 2d12555028 |
hex | 19b478e5bd |
110402004413 has 2 divisors, whose sum is σ = 110402004414. Its totient is φ = 110402004412.
The previous prime is 110402004403. The next prime is 110402004431. The reversal of 110402004413 is 314400204011.
Together with next prime (110402004431) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 89648144569 + 20753859844 = 299413^2 + 144062^2 .
It is an emirp because it is prime and its reverse (314400204011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110402004413 - 214 = 110401988029 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110402004403) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55201002206 + 55201002207.
It is an arithmetic number, because the mean of its divisors is an integer number (55201002207).
Almost surely, 2110402004413 is an apocalyptic number.
It is an amenable number.
110402004413 is a deficient number, since it is larger than the sum of its proper divisors (1).
110402004413 is an equidigital number, since it uses as much as digits as its factorization.
110402004413 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 110402004413 its reverse (314400204011), we get a palindrome (424802208424).
The spelling of 110402004413 in words is "one hundred ten billion, four hundred two million, four thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.228 sec. • engine limits •