Base | Representation |
---|---|
bin | 100001011000011… |
… | …0110001010100111 |
3 | 2220001200000202101 |
4 | 1002300312022213 |
5 | 4243221213111 |
6 | 303051352531 |
7 | 36520462450 |
oct | 10260661247 |
9 | 2801600671 |
10 | 1120101031 |
11 | 5252a4535 |
12 | 273152747 |
13 | 14b09b09a |
14 | a8a92127 |
15 | 68506bc1 |
hex | 42c362a7 |
1120101031 has 4 divisors (see below), whose sum is σ = 1280115472. Its totient is φ = 960086592.
The previous prime is 1120101013. The next prime is 1120101043. The reversal of 1120101031 is 1301010211.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1120101031 - 215 = 1120068263 is a prime.
It is a super-2 number, since 2×11201010312 = 2509252639294525922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1120100999 and 1120101017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1120104031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 80007210 + ... + 80007223.
It is an arithmetic number, because the mean of its divisors is an integer number (320028868).
Almost surely, 21120101031 is an apocalyptic number.
1120101031 is a deficient number, since it is larger than the sum of its proper divisors (160014441).
1120101031 is an equidigital number, since it uses as much as digits as its factorization.
1120101031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 160014440.
The product of its (nonzero) digits is 6, while the sum is 10.
The square root of 1120101031 is about 33467.9104665947. The cubic root of 1120101031 is about 1038.5300457927.
Adding to 1120101031 its reverse (1301010211), we get a palindrome (2421111242).
The spelling of 1120101031 in words is "one billion, one hundred twenty million, one hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •