Base | Representation |
---|---|
bin | 110101001100111010… |
… | …1110011001001111101 |
3 | 101220220021211211022022 |
4 | 1222121311303021331 |
5 | 3332441020320114 |
6 | 124252533325525 |
7 | 11153140252424 |
oct | 1523165631175 |
9 | 356807754268 |
10 | 114250166909 |
11 | 444a927144a |
12 | 1a1861968a5 |
13 | aa09bbbc78 |
14 | 575b8582bb |
15 | 2e8a2d648e |
hex | 1a99d7327d |
114250166909 has 2 divisors, whose sum is σ = 114250166910. Its totient is φ = 114250166908.
The previous prime is 114250166879. The next prime is 114250166911. The reversal of 114250166909 is 909661052411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 95096990884 + 19153176025 = 308378^2 + 138395^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-114250166909 is a prime.
It is a super-2 number, since 2×1142501669092 (a number of 23 digits) contains 22 as substring.
Together with 114250166911, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 114250166909.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114250166929) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57125083454 + 57125083455.
It is an arithmetic number, because the mean of its divisors is an integer number (57125083455).
Almost surely, 2114250166909 is an apocalyptic number.
It is an amenable number.
114250166909 is a deficient number, since it is larger than the sum of its proper divisors (1).
114250166909 is an equidigital number, since it uses as much as digits as its factorization.
114250166909 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 116640, while the sum is 44.
The spelling of 114250166909 in words is "one hundred fourteen billion, two hundred fifty million, one hundred sixty-six thousand, nine hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •