Base | Representation |
---|---|
bin | 100001001101011… |
… | …1000011001110111 |
3 | 2212122211111021010 |
4 | 1002122320121313 |
5 | 4240232434111 |
6 | 302324123303 |
7 | 36420521334 |
oct | 10232703167 |
9 | 2778744233 |
10 | 1114343031 |
11 | 52202145a |
12 | 271236533 |
13 | 149b33299 |
14 | a7dd398b |
15 | 67c6aaa6 |
hex | 426b8677 |
1114343031 has 8 divisors (see below), whose sum is σ = 1550390400. Its totient is φ = 710595512.
The previous prime is 1114343003. The next prime is 1114343039. The reversal of 1114343031 is 1303434111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1114343031 - 227 = 980125303 is a prime.
It is a super-2 number, since 2×11143430312 = 2483520781476533922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1114342989 and 1114343007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1114343039) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8074881 + ... + 8075018.
It is an arithmetic number, because the mean of its divisors is an integer number (193798800).
Almost surely, 21114343031 is an apocalyptic number.
1114343031 is a deficient number, since it is larger than the sum of its proper divisors (436047369).
1114343031 is a wasteful number, since it uses less digits than its factorization.
1114343031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16149925.
The product of its (nonzero) digits is 432, while the sum is 21.
The square root of 1114343031 is about 33381.7769299359. The cubic root of 1114343031 is about 1036.7474291954.
Adding to 1114343031 its reverse (1303434111), we get a palindrome (2417777142).
The spelling of 1114343031 in words is "one billion, one hundred fourteen million, three hundred forty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •