Base | Representation |
---|---|
bin | 1000011000011110101… |
… | …0111110110001110101 |
3 | 111202201022102200102012 |
4 | 2012013222332301311 |
5 | 4324413042041432 |
6 | 150053552254005 |
7 | 13255463520164 |
oct | 2060752766165 |
9 | 452638380365 |
10 | 144010112117 |
11 | 5608aa54793 |
12 | 23ab0841305 |
13 | 107706142c1 |
14 | 6d820553db |
15 | 3b2cce2cb2 |
hex | 2187abec75 |
144010112117 has 2 divisors, whose sum is σ = 144010112118. Its totient is φ = 144010112116.
The previous prime is 144010112093. The next prime is 144010112291. The reversal of 144010112117 is 711211010441.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 136183878961 + 7826233156 = 369031^2 + 88466^2 .
It is an emirp because it is prime and its reverse (711211010441) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 144010112117 - 222 = 144005917813 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 144010112092 and 144010112101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (144010112317) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72005056058 + 72005056059.
It is an arithmetic number, because the mean of its divisors is an integer number (72005056059).
Almost surely, 2144010112117 is an apocalyptic number.
It is an amenable number.
144010112117 is a deficient number, since it is larger than the sum of its proper divisors (1).
144010112117 is an equidigital number, since it uses as much as digits as its factorization.
144010112117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 224, while the sum is 23.
Adding to 144010112117 its reverse (711211010441), we get a palindrome (855221122558).
The spelling of 144010112117 in words is "one hundred forty-four billion, ten million, one hundred twelve thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •