Base | Representation |
---|---|
bin | 11001111011000110011010… |
… | …100101001011110101100111 |
3 | 112221200111012011210002121111 |
4 | 121323012122211023311213 |
5 | 104420440100034431044 |
6 | 1042252341454525451 |
7 | 33005063020441354 |
oct | 3173063245136547 |
9 | 487614164702544 |
10 | 114012500311399 |
11 | 33367480142828 |
12 | 10954477806887 |
13 | 4b80442a95451 |
14 | 202233d4d562b |
15 | d2aad7d18b34 |
hex | 67b19a94bd67 |
114012500311399 has 2 divisors, whose sum is σ = 114012500311400. Its totient is φ = 114012500311398.
The previous prime is 114012500311397. The next prime is 114012500311439. The reversal of 114012500311399 is 993113005210411.
It is a happy number.
It is an a-pointer prime, because the next prime (114012500311439) can be obtained adding 114012500311399 to its sum of digits (40).
It is a weak prime.
It is an emirp because it is prime and its reverse (993113005210411) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 114012500311399 - 21 = 114012500311397 is a prime.
Together with 114012500311397, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114012500311397) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57006250155699 + 57006250155700.
It is an arithmetic number, because the mean of its divisors is an integer number (57006250155700).
Almost surely, 2114012500311399 is an apocalyptic number.
114012500311399 is a deficient number, since it is larger than the sum of its proper divisors (1).
114012500311399 is an equidigital number, since it uses as much as digits as its factorization.
114012500311399 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 29160, while the sum is 40.
The spelling of 114012500311399 in words is "one hundred fourteen trillion, twelve billion, five hundred million, three hundred eleven thousand, three hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •