Base | Representation |
---|---|
bin | 110101001001101011… |
… | …0001010010110011011 |
3 | 101220121200211020112122 |
4 | 1222103112022112123 |
5 | 3332230122210021 |
6 | 124234042131455 |
7 | 11150345164013 |
oct | 1522326122633 |
9 | 356550736478 |
10 | 114141210011 |
11 | 44452812524 |
12 | 1a1557b0b8b |
13 | a9c046062a |
14 | 574b1b4c43 |
15 | 2e80962bab |
hex | 1a9358a59b |
114141210011 has 2 divisors, whose sum is σ = 114141210012. Its totient is φ = 114141210010.
The previous prime is 114141209999. The next prime is 114141210013. The reversal of 114141210011 is 110012141411.
It is a strong prime.
It is an emirp because it is prime and its reverse (110012141411) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 114141210011 - 26 = 114141209947 is a prime.
Together with 114141210013, 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 (114141210013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57070605005 + 57070605006.
It is an arithmetic number, because the mean of its divisors is an integer number (57070605006).
Almost surely, 2114141210011 is an apocalyptic number.
114141210011 is a deficient number, since it is larger than the sum of its proper divisors (1).
114141210011 is an equidigital number, since it uses as much as digits as its factorization.
114141210011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 114141210011 its reverse (110012141411), we get a palindrome (224153351422).
The spelling of 114141210011 in words is "one hundred fourteen billion, one hundred forty-one million, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •