Base | Representation |
---|---|
bin | 11001111111100111110001… |
… | …110111010011001111010011 |
3 | 112222210012011112102122220212 |
4 | 121333213301313103033103 |
5 | 104441032404243322121 |
6 | 1043051204253154335 |
7 | 33036402346120154 |
oct | 3177476167231723 |
9 | 488705145378825 |
10 | 114323202323411 |
11 | 3347721a348054 |
12 | 109a472918b9ab |
13 | 4ba3829b76633 |
14 | 20333b5ad992b |
15 | d33c1ed0425b |
hex | 67f9f1dd33d3 |
114323202323411 has 2 divisors, whose sum is σ = 114323202323412. Its totient is φ = 114323202323410.
The previous prime is 114323202323401. The next prime is 114323202323413.
114323202323411 is nontrivially palindromic in base 10.
It is a strong prime.
It is a palprime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-114323202323411 is a prime.
Together with 114323202323413, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (114323202323413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57161601161705 + 57161601161706.
It is an arithmetic number, because the mean of its divisors is an integer number (57161601161706).
Almost surely, 2114323202323411 is an apocalyptic number.
114323202323411 is a deficient number, since it is larger than the sum of its proper divisors (1).
114323202323411 is an equidigital number, since it uses as much as digits as its factorization.
114323202323411 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20736, while the sum is 32.
It can be divided in two parts, 11432320 and 2323411, that added together give a palindrome (13755731).
The spelling of 114323202323411 in words is "one hundred fourteen trillion, three hundred twenty-three billion, two hundred two million, three hundred twenty-three thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •