Base | Representation |
---|---|
bin | 110011001111011101… |
… | …0100000110101111001 |
3 | 101112000220021111221022 |
4 | 1212132322200311321 |
5 | 3300330310241101 |
6 | 122315105552225 |
7 | 10643621204363 |
oct | 1463672406571 |
9 | 345026244838 |
10 | 110040321401 |
11 | 4273899018a |
12 | 193b0345675 |
13 | a4b8976b1a |
14 | 547c6bbd33 |
15 | 2ce090ea1b |
hex | 199eea0d79 |
110040321401 has 2 divisors, whose sum is σ = 110040321402. Its totient is φ = 110040321400.
The previous prime is 110040321383. The next prime is 110040321407. The reversal of 110040321401 is 104123040011.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 58283616400 + 51756705001 = 241420^2 + 227501^2 .
It is an emirp because it is prime and its reverse (104123040011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110040321401 - 26 = 110040321337 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110040321401.
It is not a weakly prime, because it can be changed into another prime (110040321407) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55020160700 + 55020160701.
It is an arithmetic number, because the mean of its divisors is an integer number (55020160701).
Almost surely, 2110040321401 is an apocalyptic number.
It is an amenable number.
110040321401 is a deficient number, since it is larger than the sum of its proper divisors (1).
110040321401 is an equidigital number, since it uses as much as digits as its factorization.
110040321401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 110040321401 its reverse (104123040011), we get a palindrome (214163361412).
The spelling of 110040321401 in words is "one hundred ten billion, forty million, three hundred twenty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •