Base | Representation |
---|---|
bin | 100001011100010… |
… | …0101110001000101 |
3 | 2220012111011100220 |
4 | 1002320211301011 |
5 | 4244231143023 |
6 | 303203054553 |
7 | 36543645663 |
oct | 10270456105 |
9 | 2805434326 |
10 | 1122131013 |
11 | 526460703 |
12 | 273971459 |
13 | 14b62c063 |
14 | a905dc33 |
15 | 687a83e3 |
hex | 42e25c45 |
1122131013 has 8 divisors (see below), whose sum is σ = 1574920800. Its totient is φ = 708714288.
The previous prime is 1122131011. The next prime is 1122131027. The reversal of 1122131013 is 3101312211.
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 1122131013 - 21 = 1122131011 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1122130983 and 1122131001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1122131011) 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 7 ways as a sum of consecutive naturals, for example, 9843198 + ... + 9843311.
It is an arithmetic number, because the mean of its divisors is an integer number (196865100).
Almost surely, 21122131013 is an apocalyptic number.
It is an amenable number.
1122131013 is a deficient number, since it is larger than the sum of its proper divisors (452789787).
1122131013 is a wasteful number, since it uses less digits than its factorization.
1122131013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19686531.
The product of its (nonzero) digits is 36, while the sum is 15.
The square root of 1122131013 is about 33498.2240275511. The cubic root of 1122131013 is about 1039.1570502461.
Adding to 1122131013 its reverse (3101312211), we get a palindrome (4223443224).
The spelling of 1122131013 in words is "one billion, one hundred twenty-two million, one hundred thirty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •