Base | Representation |
---|---|
bin | 11001111110001001101001… |
… | …001000110111000000010101 |
3 | 112222102112021020002222022212 |
4 | 121332021221020313000111 |
5 | 104432403402243344312 |
6 | 1042532530334203205 |
7 | 33026163501211454 |
oct | 3176115110670025 |
9 | 488375236088285 |
10 | 114222124199957 |
11 | 33438370389934 |
12 | 1098901a353505 |
13 | 4b9713bba5827 |
14 | 202c5477d2b9b |
15 | d312a6105822 |
hex | 67e269237015 |
114222124199957 has 2 divisors, whose sum is σ = 114222124199958. Its totient is φ = 114222124199956.
The previous prime is 114222124199917. The next prime is 114222124200071. The reversal of 114222124199957 is 759991421222411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 107585312607556 + 6636811592401 = 10372334^2 + 2576201^2 .
It is a cyclic number.
It is not a de Polignac number, because 114222124199957 - 216 = 114222124134421 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 114222124199896 and 114222124199905.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114222124199917) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57111062099978 + 57111062099979.
It is an arithmetic number, because the mean of its divisors is an integer number (57111062099979).
Almost surely, 2114222124199957 is an apocalyptic number.
It is an amenable number.
114222124199957 is a deficient number, since it is larger than the sum of its proper divisors (1).
114222124199957 is an equidigital number, since it uses as much as digits as its factorization.
114222124199957 is an evil number, because the sum of its binary digits is even.
The product of its digits is 6531840, while the sum is 59.
The spelling of 114222124199957 in words is "one hundred fourteen trillion, two hundred twenty-two billion, one hundred twenty-four million, one hundred ninety-nine thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •