Base | Representation |
---|---|
bin | 100000111000000… |
… | …0111100111001010 |
3 | 2211212201222011121 |
4 | 1001300013213022 |
5 | 4224400230010 |
6 | 301243545454 |
7 | 36223322401 |
oct | 10160074712 |
9 | 2755658147 |
10 | 1103133130 |
11 | 516765280 |
12 | 26952b28a |
13 | 147709ac8 |
14 | a6716638 |
15 | 66ca43da |
hex | 41c079ca |
1103133130 has 64 divisors (see below), whose sum is σ = 2267191296. Its totient is φ = 382536000.
The previous prime is 1103133121. The next prime is 1103133139. The reversal of 1103133130 is 313313011.
It is an interprime number because it is at equal distance from previous prime (1103133121) and next prime (1103133139).
It is not an unprimeable number, because it can be changed into a prime (1103133139) 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 31 ways as a sum of consecutive naturals, for example, 1596085 + ... + 1596775.
It is an arithmetic number, because the mean of its divisors is an integer number (35424864).
Almost surely, 21103133130 is an apocalyptic number.
1103133130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1103133130 is an abundant number, since it is smaller than the sum of its proper divisors (1164058166).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1103133130 is a wasteful number, since it uses less digits than its factorization.
1103133130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1363.
The product of its (nonzero) digits is 81, while the sum is 16.
The square root of 1103133130 is about 33213.4480293751. The cubic root of 1103133130 is about 1033.2592675553.
Adding to 1103133130 its reverse (313313011), we get a palindrome (1416446141).
The spelling of 1103133130 in words is "one billion, one hundred three million, one hundred thirty-three thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •