Base | Representation |
---|---|
bin | 1011100011110101… |
… | …1101111011101010 |
3 | 22000021001212221020 |
4 | 2320331131323222 |
5 | 22323344334010 |
6 | 1231530353310 |
7 | 136620044244 |
oct | 27075357352 |
9 | 8007055836 |
10 | 3103121130 |
11 | 13526a391a |
12 | 72728b836 |
13 | 3a5b7b865 |
14 | 2161ab094 |
15 | 132663470 |
hex | b8f5deea |
3103121130 has 64 divisors (see below), whose sum is σ = 7787059200. Its totient is φ = 789915456.
The previous prime is 3103121117. The next prime is 3103121159. The reversal of 3103121130 is 311213013.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 356571 + ... + 365169.
It is an arithmetic number, because the mean of its divisors is an integer number (121672800).
Almost surely, 23103121130 is an apocalyptic number.
3103121130 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 3103121130, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3893529600).
3103121130 is an abundant number, since it is smaller than the sum of its proper divisors (4683938070).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3103121130 is a wasteful number, since it uses less digits than its factorization.
3103121130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9155.
The product of its (nonzero) digits is 54, while the sum is 15.
The square root of 3103121130 is about 55705.6651517599. The cubic root of 3103121130 is about 1458.5889178019.
Adding to 3103121130 its reverse (311213013), we get a palindrome (3414334143).
The spelling of 3103121130 in words is "three billion, one hundred three million, one hundred twenty-one thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •