Base | Representation |
---|---|
bin | 100001011000001… |
… | …1101110000000111 |
3 | 2220001110221120200 |
4 | 1002300131300013 |
5 | 4243210013111 |
6 | 303045301543 |
7 | 36516565062 |
oct | 10260356007 |
9 | 2801427520 |
10 | 1120001031 |
11 | 525236396 |
12 | 2731048b3 |
13 | 14b064706 |
14 | a8a678d9 |
15 | 684d7256 |
hex | 42c1dc07 |
1120001031 has 48 divisors (see below), whose sum is σ = 1717148160. Its totient is φ = 702060480.
The previous prime is 1120000991. The next prime is 1120001033. The reversal of 1120001031 is 1301000211.
It is not a de Polignac number, because 1120001031 - 218 = 1119738887 is a prime.
It is a super-2 number, since 2×11200010312 = 2508804618882125922, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1120001033) 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 47 ways as a sum of consecutive naturals, for example, 6187761 + ... + 6187941.
It is an arithmetic number, because the mean of its divisors is an integer number (35773920).
Almost surely, 21120001031 is an apocalyptic number.
1120001031 is a deficient number, since it is larger than the sum of its proper divisors (597147129).
1120001031 is a wasteful number, since it uses less digits than its factorization.
1120001031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 556 (or 553 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
The square root of 1120001031 is about 33466.4164648682. The cubic root of 1120001031 is about 1038.4991390285.
Adding to 1120001031 its reverse (1301000211), we get a palindrome (2421001242).
The spelling of 1120001031 in words is "one billion, one hundred twenty million, one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •