Base | Representation |
---|---|
bin | 101111111110000001… |
… | …1011111000111001110 |
3 | 100211220011011121211010 |
4 | 1133330003133013032 |
5 | 3141432313120420 |
6 | 115153514310050 |
7 | 10304521136460 |
oct | 1377403370716 |
9 | 324804147733 |
10 | 103013020110 |
11 | 3a762189770 |
12 | 17b6aa28326 |
13 | 9938b02390 |
14 | 4db3296130 |
15 | 2a2da014e0 |
hex | 17fc0df1ce |
103013020110 has 128 divisors (see below), whose sum is σ = 331946947584. Its totient is φ = 19758735360.
The previous prime is 103013020109. The next prime is 103013020139. The reversal of 103013020110 is 11020310301.
It is a super-2 number, since 2×1030130201102 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1685139 + ... + 1745198.
It is an arithmetic number, because the mean of its divisors is an integer number (2593335528).
Almost surely, 2103013020110 is an apocalyptic number.
103013020110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103013020110 is an abundant number, since it is smaller than the sum of its proper divisors (228933927474).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103013020110 is a wasteful number, since it uses less digits than its factorization.
103013020110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3430378.
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 103013020110 its reverse (11020310301), we get a palindrome (114033330411).
Subtracting from 103013020110 its reverse (11020310301), we obtain a square (91992709809 = 3033032).
The spelling of 103013020110 in words is "one hundred three billion, thirteen million, twenty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.127 sec. • engine limits •