Base | Representation |
---|---|
bin | 100001000101010… |
… | …1111111101010011 |
3 | 2212100212122022012 |
4 | 1002022233331103 |
5 | 4233142123011 |
6 | 302053333135 |
7 | 36336546230 |
oct | 10212577523 |
9 | 2770778265 |
10 | 1110114131 |
11 | 51a6a31a5 |
12 | 26b9371ab |
13 | 148cb2489 |
14 | a7612787 |
15 | 676d2a8b |
hex | 422aff53 |
1110114131 has 8 divisors (see below), whose sum is σ = 1274012160. Its totient is φ = 947543688.
The previous prime is 1110114079. The next prime is 1110114133. The reversal of 1110114131 is 1314110111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1110114131 - 222 = 1105919827 is a prime.
It is a super-2 number, since 2×11101141312 = 2464706767691770322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1110114133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 330101 + ... + 333446.
It is an arithmetic number, because the mean of its divisors is an integer number (159251520).
Almost surely, 21110114131 is an apocalyptic number.
1110114131 is a deficient number, since it is larger than the sum of its proper divisors (163898029).
1110114131 is an equidigital number, since it uses as much as digits as its factorization.
1110114131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 663793.
The product of its (nonzero) digits is 12, while the sum is 14.
The square root of 1110114131 is about 33318.3752755143. The cubic root of 1110114131 is about 1035.4342910494.
Adding to 1110114131 its reverse (1314110111), we get a palindrome (2424224242).
The spelling of 1110114131 in words is "one billion, one hundred ten million, one hundred fourteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •