Base | Representation |
---|---|
bin | 100001011010001… |
… | …0100110100100110 |
3 | 2220010101100210010 |
4 | 1002310110310212 |
5 | 4243434404110 |
6 | 303123111050 |
7 | 36531311364 |
oct | 10264246446 |
9 | 2803340703 |
10 | 1121013030 |
11 | 525867755 |
12 | 273512486 |
13 | 14b32a227 |
14 | a8c4c634 |
15 | 68637020 |
hex | 42d14d26 |
1121013030 has 16 divisors (see below), whose sum is σ = 2690431344. Its totient is φ = 298936800.
The previous prime is 1121012989. The next prime is 1121013037. The reversal of 1121013030 is 303101211.
It is a junction number, because it is equal to n+sod(n) for n = 1121012997 and 1121013015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121013037) 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, 18683521 + ... + 18683580.
It is an arithmetic number, because the mean of its divisors is an integer number (168151959).
Almost surely, 21121013030 is an apocalyptic number.
1121013030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1121013030 is an abundant number, since it is smaller than the sum of its proper divisors (1569418314).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1121013030 is a wasteful number, since it uses less digits than its factorization.
1121013030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37367111.
The product of its (nonzero) digits is 18, while the sum is 12.
The square root of 1121013030 is about 33481.5326710113. The cubic root of 1121013030 is about 1038.8118303212.
Adding to 1121013030 its reverse (303101211), we get a palindrome (1424114241).
The spelling of 1121013030 in words is "one billion, one hundred twenty-one million, thirteen thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •