Base | Representation |
---|---|
bin | 110101001110110001… |
… | …1100101010000000011 |
3 | 101221001122010200112201 |
4 | 1222131203211100003 |
5 | 3333103000001402 |
6 | 124303041334031 |
7 | 11154525135262 |
oct | 1523543452003 |
9 | 357048120481 |
10 | 114312500227 |
11 | 44530476392 |
12 | 1a1a3037317 |
13 | aa19aa4ca3 |
14 | 5765c425d9 |
15 | 2e909ea687 |
hex | 1a9d8e5403 |
114312500227 has 2 divisors, whose sum is σ = 114312500228. Its totient is φ = 114312500226.
The previous prime is 114312500149. The next prime is 114312500243. The reversal of 114312500227 is 722005213411.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 114312500227 - 215 = 114312467459 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 114312500195 and 114312500204.
It is not a weakly prime, because it can be changed into another prime (114312510227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57156250113 + 57156250114.
It is an arithmetic number, because the mean of its divisors is an integer number (57156250114).
Almost surely, 2114312500227 is an apocalyptic number.
114312500227 is a deficient number, since it is larger than the sum of its proper divisors (1).
114312500227 is an equidigital number, since it uses as much as digits as its factorization.
114312500227 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 28.
Adding to 114312500227 its reverse (722005213411), we get a palindrome (836317713638).
The spelling of 114312500227 in words is "one hundred fourteen billion, three hundred twelve million, five hundred thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •