Base | Representation |
---|---|
bin | 11001111110001001111011… |
… | …111101101010000100000011 |
3 | 112222102120002020101211100011 |
4 | 121332021323331222010003 |
5 | 104432410024121433332 |
6 | 1042533021535405351 |
7 | 33026204354553226 |
oct | 3176117375520403 |
9 | 488376066354304 |
10 | 114222440030467 |
11 | 33438512695a8a |
12 | 109890a8083857 |
13 | 4b9718c456ca2 |
14 | 202c5777275bd |
15 | d312c3bdee47 |
hex | 67e27bf6a103 |
114222440030467 has 2 divisors, whose sum is σ = 114222440030468. Its totient is φ = 114222440030466.
The previous prime is 114222440030317. The next prime is 114222440030507. The reversal of 114222440030467 is 764030044222411.
It is an a-pointer prime, because the next prime (114222440030507) can be obtained adding 114222440030467 to its sum of digits (40).
It is a strong prime.
It is an emirp because it is prime and its reverse (764030044222411) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 114222440030467 - 227 = 114222305812739 is a prime.
It is not a weakly prime, because it can be changed into another prime (114222440090467) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57111220015233 + 57111220015234.
It is an arithmetic number, because the mean of its divisors is an integer number (57111220015234).
Almost surely, 2114222440030467 is an apocalyptic number.
114222440030467 is a deficient number, since it is larger than the sum of its proper divisors (1).
114222440030467 is an equidigital number, since it uses as much as digits as its factorization.
114222440030467 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 258048, while the sum is 40.
Adding to 114222440030467 its reverse (764030044222411), we get a palindrome (878252484252878).
The spelling of 114222440030467 in words is "one hundred fourteen trillion, two hundred twenty-two billion, four hundred forty million, thirty thousand, four hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •