Base | Representation |
---|---|
bin | 101111111110000001… |
… | …1110011011000011010 |
3 | 100211220011022211200221 |
4 | 1133330003303120122 |
5 | 3141432323300010 |
6 | 115153520150254 |
7 | 10304521633510 |
oct | 1377403633032 |
9 | 324804284627 |
10 | 103013103130 |
11 | 3a762236083 |
12 | 17b6aa6838a |
13 | 9938b310c2 |
14 | 4db32b84b0 |
15 | 2a2da1adda |
hex | 17fc0f361a |
103013103130 has 64 divisors (see below), whose sum is σ = 230757984000. Its totient is φ = 32306093568.
The previous prime is 103013103121. The next prime is 103013103139. The reversal of 103013103130 is 31301310301.
It is an interprime number because it is at equal distance from previous prime (103013103121) and next prime (103013103139).
It is a super-2 number, since 2×1030131031302 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (103013103139) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1296835 + ... + 1373974.
It is an arithmetic number, because the mean of its divisors is an integer number (3605593500).
Almost surely, 2103013103130 is an apocalyptic number.
103013103130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103013103130 is an abundant number, since it is smaller than the sum of its proper divisors (127744880870).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103013103130 is a wasteful number, since it uses less digits than its factorization.
103013103130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2670871.
The product of its (nonzero) digits is 81, while the sum is 16.
Adding to 103013103130 its reverse (31301310301), we get a palindrome (134314413431).
The spelling of 103013103130 in words is "one hundred three billion, thirteen million, one hundred three thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •