Base | Representation |
---|---|
bin | 111100010001001… |
… | …010001011101010 |
3 | 2121110121210010112 |
4 | 330101022023222 |
5 | 4032322143424 |
6 | 244200014322 |
7 | 34025321060 |
oct | 7421121352 |
9 | 2543553115 |
10 | 1011131114 |
11 | 479836854 |
12 | 2427613a2 |
13 | 131636846 |
14 | 98408030 |
15 | 5db7e60e |
hex | 3c44a2ea |
1011131114 has 8 divisors (see below), whose sum is σ = 1733367648. Its totient is φ = 433341900.
The previous prime is 1011131087. The next prime is 1011131137. The reversal of 1011131114 is 4111311101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×10111311142 = 2044772259397761992, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14), and also a Moran number because the ratio is a prime number: 72223651 = 1011131114 / (1 + 0 + 1 + 1 + 1 + 3 + 1 + 1 + 1 + 4).
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 36111812 + ... + 36111839.
It is an arithmetic number, because the mean of its divisors is an integer number (216670956).
Almost surely, 21011131114 is an apocalyptic number.
1011131114 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
1011131114 is a deficient number, since it is larger than the sum of its proper divisors (722236534).
1011131114 is an equidigital number, since it uses as much as digits as its factorization.
1011131114 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 72223660.
The product of its (nonzero) digits is 12, while the sum is 14.
The square root of 1011131114 is about 31798.2879098860. The cubic root of 1011131114 is about 1003.6966889848.
Adding to 1011131114 its reverse (4111311101), we get a palindrome (5122442215).
The spelling of 1011131114 in words is "one billion, eleven million, one hundred thirty-one thousand, one hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •