Base | Representation |
---|---|
bin | 110000000000100111… |
… | …1101101100100001000 |
3 | 100212010020001022012210 |
4 | 1200001033231210020 |
5 | 3142122112023422 |
6 | 115210305105120 |
7 | 10306626325215 |
oct | 1400117554410 |
9 | 325106038183 |
10 | 103100111112 |
11 | 3a7a73634a9 |
12 | 17b940281a0 |
13 | 9950b7620b |
14 | 4dc0a86b0c |
15 | 2a364a610c |
hex | 18013ed908 |
103100111112 has 16 divisors (see below), whose sum is σ = 257750277840. Its totient is φ = 34366703696.
The previous prime is 103100111099. The next prime is 103100111113. The reversal of 103100111112 is 211111001301.
It is a super-2 number, since 2×1031001111122 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (103100111113) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2147918958 + ... + 2147919005.
It is an arithmetic number, because the mean of its divisors is an integer number (16109392365).
Almost surely, 2103100111112 is an apocalyptic number.
103100111112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
103100111112 is an abundant number, since it is smaller than the sum of its proper divisors (154650166728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103100111112 is a wasteful number, since it uses less digits than its factorization.
103100111112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4295837972 (or 4295837968 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 12.
Adding to 103100111112 its reverse (211111001301), we get a palindrome (314211112413).
The spelling of 103100111112 in words is "one hundred three billion, one hundred million, one hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •