Base | Representation |
---|---|
bin | 11001111011100100000011… |
… | …001101010001100101001111 |
3 | 112221210112022202221012122121 |
4 | 121323210003031101211033 |
5 | 104422000232012002343 |
6 | 1042315123150153411 |
7 | 33010300401064642 |
oct | 3173440315214517 |
9 | 487715282835577 |
10 | 114044320422223 |
11 | 33379a19826a84 |
12 | 1095a6781b2867 |
13 | 4b8344426c2a9 |
14 | 2023abb56da59 |
15 | d2b84b61eaed |
hex | 67b90335194f |
114044320422223 has 2 divisors, whose sum is σ = 114044320422224. Its totient is φ = 114044320422222.
The previous prime is 114044320422209. The next prime is 114044320422229. The reversal of 114044320422223 is 322224023440411.
It is a strong prime.
It is an emirp because it is prime and its reverse (322224023440411) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 114044320422223 - 221 = 114044318325071 is a prime.
It is a super-2 number, since 2×1140443204222232 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114044320422229) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57022160211111 + 57022160211112.
It is an arithmetic number, because the mean of its divisors is an integer number (57022160211112).
Almost surely, 2114044320422223 is an apocalyptic number.
114044320422223 is a deficient number, since it is larger than the sum of its proper divisors (1).
114044320422223 is an equidigital number, since it uses as much as digits as its factorization.
114044320422223 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 73728, while the sum is 34.
Adding to 114044320422223 its reverse (322224023440411), we get a palindrome (436268343862634).
The spelling of 114044320422223 in words is "one hundred fourteen trillion, forty-four billion, three hundred twenty million, four hundred twenty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •