Base | Representation |
---|---|
bin | 11001111110001010011110… |
… | …000000111101100101100101 |
3 | 112222102121120001101110021201 |
4 | 121332022132000331211211 |
5 | 104432412211344302323 |
6 | 1042533154344242501 |
7 | 33026224462503643 |
oct | 3176123600754545 |
9 | 488377501343251 |
10 | 114223011322213 |
11 | 33438786115a22 |
12 | 10989227470431 |
13 | 4b97250910841 |
14 | 202c5cd55a193 |
15 | d31308e3b8ad |
hex | 67e29e03d965 |
114223011322213 has 2 divisors, whose sum is σ = 114223011322214. Its totient is φ = 114223011322212.
The previous prime is 114223011322193. The next prime is 114223011322223. The reversal of 114223011322213 is 312223110322411.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 84024667251009 + 30198344071204 = 9166497^2 + 5495302^2 .
It is a cyclic number.
It is not a de Polignac number, because 114223011322213 - 237 = 114085572368741 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114223011322223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57111505661106 + 57111505661107.
It is an arithmetic number, because the mean of its divisors is an integer number (57111505661107).
Almost surely, 2114223011322213 is an apocalyptic number.
It is an amenable number.
114223011322213 is a deficient number, since it is larger than the sum of its proper divisors (1).
114223011322213 is an equidigital number, since it uses as much as digits as its factorization.
114223011322213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 28.
Adding to 114223011322213 its reverse (312223110322411), we get a palindrome (426446121644624).
The spelling of 114223011322213 in words is "one hundred fourteen trillion, two hundred twenty-three billion, eleven million, three hundred twenty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •