Base | Representation |
---|---|
bin | 110101001000011100… |
… | …1011011100111001111 |
3 | 101220111211111212021122 |
4 | 1222100321123213033 |
5 | 3332134112432421 |
6 | 124230013351155 |
7 | 11146336024031 |
oct | 1522071334717 |
9 | 356454455248 |
10 | 114100124111 |
11 | 44431600036 |
12 | 1a143a984bb |
13 | a9b4aa674c |
14 | 574595bc51 |
15 | 2e7c0492ab |
hex | 1a90e5b9cf |
114100124111 has 4 divisors (see below), whose sum is σ = 114855754224. Its totient is φ = 113344494000.
The previous prime is 114100124101. The next prime is 114100124147. The reversal of 114100124111 is 111421001411.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 111421001411 = 1667 ⋅66839233.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-114100124111 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 114100124111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114100124101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 377814830 + ... + 377815131.
It is an arithmetic number, because the mean of its divisors is an integer number (28713938556).
Almost surely, 2114100124111 is an apocalyptic number.
114100124111 is a deficient number, since it is larger than the sum of its proper divisors (755630113).
114100124111 is an equidigital number, since it uses as much as digits as its factorization.
114100124111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 755630112.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 114100124111 its reverse (111421001411), we get a palindrome (225521125522).
The spelling of 114100124111 in words is "one hundred fourteen billion, one hundred million, one hundred twenty-four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •