Base | Representation |
---|---|
bin | 100001101101110… |
… | …0100100010100111 |
3 | 2220211202001021012 |
4 | 1003123210202213 |
5 | 4304103113111 |
6 | 304131412435 |
7 | 40014620510 |
oct | 10333444247 |
9 | 2824661235 |
10 | 1131301031 |
11 | 530654233 |
12 | 276a5411b |
13 | 1504bcbc3 |
14 | aa369a07 |
15 | 694ba48b |
hex | 436e48a7 |
1131301031 has 4 divisors (see below), whose sum is σ = 1292915472. Its totient is φ = 969686592.
The previous prime is 1131301001. The next prime is 1131301037. The reversal of 1131301031 is 1301031311.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 1131301031 - 210 = 1131300007 is a prime.
It is a super-2 number, since 2×11313010312 = 2559684045483325922, 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 = 1131300997 and 1131301015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1131301037) 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, 80807210 + ... + 80807223.
It is an arithmetic number, because the mean of its divisors is an integer number (323228868).
Almost surely, 21131301031 is an apocalyptic number.
1131301031 is a deficient number, since it is larger than the sum of its proper divisors (161614441).
1131301031 is an equidigital number, since it uses as much as digits as its factorization.
1131301031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161614440.
The product of its (nonzero) digits is 27, while the sum is 14.
The square root of 1131301031 is about 33634.8187300006. The cubic root of 1131301031 is about 1041.9800268913.
Adding to 1131301031 its reverse (1301031311), we get a palindrome (2432332342).
The spelling of 1131301031 in words is "one billion, one hundred thirty-one million, three hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •