Base | Representation |
---|---|
bin | 1101100101110… |
… | …01010000010011 |
3 | 21221112001110211 |
4 | 12302321100103 |
5 | 213141130021 |
6 | 15151304551 |
7 | 2553012061 |
oct | 662712023 |
9 | 257461424 |
10 | 114005011 |
11 | 5939771a |
12 | 3221b157 |
13 | 1a8082b3 |
14 | 111d9031 |
15 | a01e3e1 |
hex | 6cb9413 |
114005011 has 4 divisors (see below), whose sum is σ = 117682624. Its totient is φ = 110327400.
The previous prime is 114004999. The next prime is 114005027. The reversal of 114005011 is 110500411.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-114005011 is a prime.
It is a super-2 number, since 2×1140050112 = 25994285066220242, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 114004982 and 114005000.
It is not an unprimeable number, because it can be changed into a prime (114005071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1838760 + ... + 1838821.
It is an arithmetic number, because the mean of its divisors is an integer number (29420656).
Almost surely, 2114005011 is an apocalyptic number.
114005011 is a deficient number, since it is larger than the sum of its proper divisors (3677613).
114005011 is an equidigital number, since it uses as much as digits as its factorization.
114005011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3677612.
The product of its (nonzero) digits is 20, while the sum is 13.
The square root of 114005011 is about 10677.3129110278. The cubic root of 114005011 is about 484.8878629755.
Adding to 114005011 its reverse (110500411), we get a palindrome (224505422).
The spelling of 114005011 in words is "one hundred fourteen million, five thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •