Base | Representation |
---|---|
bin | 110101010111101001… |
… | …1100001011111101101 |
3 | 101221211101110111012002 |
4 | 1222233103201133231 |
5 | 3334210212433204 |
6 | 124352400022045 |
7 | 11165102211161 |
oct | 1525723413755 |
9 | 357741414162 |
10 | 114610280429 |
11 | 44673574027 |
12 | 1a266901925 |
13 | aa666a65a8 |
14 | 57935d8ca1 |
15 | 2eabc1b91e |
hex | 1aaf4e17ed |
114610280429 has 2 divisors, whose sum is σ = 114610280430. Its totient is φ = 114610280428.
The previous prime is 114610280377. The next prime is 114610280443. The reversal of 114610280429 is 924082016411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 59007697225 + 55602583204 = 242915^2 + 235802^2 .
It is an emirp because it is prime and its reverse (924082016411) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 114610280429 - 216 = 114610214893 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 114610280392 and 114610280401.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114610280129) 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, 57305140214 + 57305140215.
It is an arithmetic number, because the mean of its divisors is an integer number (57305140215).
Almost surely, 2114610280429 is an apocalyptic number.
It is an amenable number.
114610280429 is a deficient number, since it is larger than the sum of its proper divisors (1).
114610280429 is an equidigital number, since it uses as much as digits as its factorization.
114610280429 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27648, while the sum is 38.
The spelling of 114610280429 in words is "one hundred fourteen billion, six hundred ten million, two hundred eighty thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.135 sec. • engine limits •