Base | Representation |
---|---|
bin | 110011010010110010… |
… | …1101110011001101011 |
3 | 101112022201000020202002 |
4 | 1212211211232121223 |
5 | 3301042442444202 |
6 | 122334150201215 |
7 | 10646451131003 |
oct | 1464545563153 |
9 | 345281006662 |
10 | 110152312427 |
11 | 42796121753 |
12 | 1942195320b |
13 | a505c284c1 |
14 | 548d511003 |
15 | 2cea682302 |
hex | 19a596e66b |
110152312427 has 2 divisors, whose sum is σ = 110152312428. Its totient is φ = 110152312426.
The previous prime is 110152312423. The next prime is 110152312441. The reversal of 110152312427 is 724213251011.
It is a weak prime.
It is an emirp because it is prime and its reverse (724213251011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110152312427 - 22 = 110152312423 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110152312427.
It is not a weakly prime, because it can be changed into another prime (110152312423) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55076156213 + 55076156214.
It is an arithmetic number, because the mean of its divisors is an integer number (55076156214).
Almost surely, 2110152312427 is an apocalyptic number.
110152312427 is a deficient number, since it is larger than the sum of its proper divisors (1).
110152312427 is an equidigital number, since it uses as much as digits as its factorization.
110152312427 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3360, while the sum is 29.
Adding to 110152312427 its reverse (724213251011), we get a palindrome (834365563438).
The spelling of 110152312427 in words is "one hundred ten billion, one hundred fifty-two million, three hundred twelve thousand, four hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •