Base | Representation |
---|---|
bin | 110101000101110000… |
… | …1110000010001000101 |
3 | 101220021112222200000011 |
4 | 1222023201300101011 |
5 | 3331443031444143 |
6 | 124213034350221 |
7 | 11144163163303 |
oct | 1521341602105 |
9 | 356245880004 |
10 | 114010031173 |
11 | 44395765965 |
12 | 1a11988b371 |
13 | a99c22140c |
14 | 57379c9273 |
15 | 2e7419ee9d |
hex | 1a8b870445 |
114010031173 has 2 divisors, whose sum is σ = 114010031174. Its totient is φ = 114010031172.
The previous prime is 114010031137. The next prime is 114010031189. The reversal of 114010031173 is 371130010411.
Together with previous prime (114010031137) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 68878427809 + 45131603364 = 262447^2 + 212442^2 .
It is a cyclic number.
It is not a de Polignac number, because 114010031173 - 29 = 114010030661 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114010031273) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57005015586 + 57005015587.
It is an arithmetic number, because the mean of its divisors is an integer number (57005015587).
Almost surely, 2114010031173 is an apocalyptic number.
It is an amenable number.
114010031173 is a deficient number, since it is larger than the sum of its proper divisors (1).
114010031173 is an equidigital number, since it uses as much as digits as its factorization.
114010031173 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 252, while the sum is 22.
Adding to 114010031173 its reverse (371130010411), we get a palindrome (485140041584).
The spelling of 114010031173 in words is "one hundred fourteen billion, ten million, thirty-one thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •