Base | Representation |
---|---|
bin | 100001011101000… |
… | …0111001101010011 |
3 | 2220020020102212001 |
4 | 1002322013031103 |
5 | 4244331431011 |
6 | 303215414431 |
7 | 36550230412 |
oct | 10272071523 |
9 | 2806212761 |
10 | 1122530131 |
11 | 526703558 |
12 | 273b24417 |
13 | 14b73b918 |
14 | a9125479 |
15 | 688367c1 |
hex | 42e87353 |
1122530131 has 4 divisors (see below), whose sum is σ = 1122679264. Its totient is φ = 1122381000.
The previous prime is 1122530117. The next prime is 1122530137. The reversal of 1122530131 is 1310352211.
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 1122530131 - 211 = 1122528083 is a prime.
It is a super-2 number, since 2×11225301312 = 2520147790005754322, 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 = 1122530099 and 1122530108.
It is not an unprimeable number, because it can be changed into a prime (1122530137) 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, 62640 + ... + 78541.
It is an arithmetic number, because the mean of its divisors is an integer number (280669816).
Almost surely, 21122530131 is an apocalyptic number.
1122530131 is a deficient number, since it is larger than the sum of its proper divisors (149133).
1122530131 is an equidigital number, since it uses as much as digits as its factorization.
1122530131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149132.
The product of its (nonzero) digits is 180, while the sum is 19.
The square root of 1122530131 is about 33504.1807988197. The cubic root of 1122530131 is about 1039.2802376209.
Adding to 1122530131 its reverse (1310352211), we get a palindrome (2432882342).
The spelling of 1122530131 in words is "one billion, one hundred twenty-two million, five hundred thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •