Base | Representation |
---|---|
bin | 110101001011110000… |
… | …1001010100001010101 |
3 | 101220210120112021002101 |
4 | 1222113201022201111 |
5 | 3332401032000112 |
6 | 124245022242101 |
7 | 11152155131452 |
oct | 1522741124125 |
9 | 356716467071 |
10 | 114211203157 |
11 | 444892793a7 |
12 | 1a175126331 |
13 | aa01ac8cac |
14 | 57565d4829 |
15 | 2e86b8b757 |
hex | 1a9784a855 |
114211203157 has 2 divisors, whose sum is σ = 114211203158. Its totient is φ = 114211203156.
The previous prime is 114211203137. The next prime is 114211203167. The reversal of 114211203157 is 751302112411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 101489393476 + 12721809681 = 318574^2 + 112791^2 .
It is a cyclic number.
It is not a de Polignac number, because 114211203157 - 211 = 114211201109 is a prime.
It is a super-3 number, since 3×1142112031573 (a number of 34 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114211203137) 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, 57105601578 + 57105601579.
It is an arithmetic number, because the mean of its divisors is an integer number (57105601579).
Almost surely, 2114211203157 is an apocalyptic number.
It is an amenable number.
114211203157 is a deficient number, since it is larger than the sum of its proper divisors (1).
114211203157 is an equidigital number, since it uses as much as digits as its factorization.
114211203157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1680, while the sum is 28.
Adding to 114211203157 its reverse (751302112411), we get a palindrome (865513315568).
The spelling of 114211203157 in words is "one hundred fourteen billion, two hundred eleven million, two hundred three thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •