Base | Representation |
---|---|
bin | 11001111110001001101001… |
… | …001000110111000010000111 |
3 | 112222102112021020002222111002 |
4 | 121332021221020313002013 |
5 | 104432403402243400241 |
6 | 1042532530334203515 |
7 | 33026163501212006 |
oct | 3176115110670207 |
9 | 488375236088432 |
10 | 114222124200071 |
11 | 33438370389a28 |
12 | 1098901a35359b |
13 | 4b9713bba58b4 |
14 | 202c5477d2c3d |
15 | d312a610589b |
hex | 67e269237087 |
114222124200071 has 2 divisors, whose sum is σ = 114222124200072. Its totient is φ = 114222124200070.
The previous prime is 114222124199957. The next prime is 114222124200133. The reversal of 114222124200071 is 170002421222411.
It is a strong prime.
It is an emirp because it is prime and its reverse (170002421222411) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-114222124200071 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114222124200671) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57111062100035 + 57111062100036.
It is an arithmetic number, because the mean of its divisors is an integer number (57111062100036).
Almost surely, 2114222124200071 is an apocalyptic number.
114222124200071 is a deficient number, since it is larger than the sum of its proper divisors (1).
114222124200071 is an equidigital number, since it uses as much as digits as its factorization.
114222124200071 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3584, while the sum is 29.
Adding to 114222124200071 its reverse (170002421222411), we get a palindrome (284224545422482).
The spelling of 114222124200071 in words is "one hundred fourteen trillion, two hundred twenty-two billion, one hundred twenty-four million, two hundred thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •