Base | Representation |
---|---|
bin | 110000000001001101… |
… | …1101010111000111100 |
3 | 100212011121111221022211 |
4 | 1200002123222320330 |
5 | 3142142211214400 |
6 | 115212255550204 |
7 | 10310260506523 |
oct | 1400233527074 |
9 | 325147457284 |
10 | 103120023100 |
11 | 3a807623696 |
12 | 17b9a82b364 |
13 | 9955028563 |
14 | 4dc358b4ba |
15 | 2a380dadba |
hex | 18026eae3c |
103120023100 has 18 divisors (see below), whose sum is σ = 223770450344. Its totient is φ = 41248009200.
The previous prime is 103120023029. The next prime is 103120023109. The reversal of 103120023100 is 1320021301.
It is a super-4 number, since 4×1031200231004 (a number of 45 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103120023109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 515600016 + ... + 515600215.
Almost surely, 2103120023100 is an apocalyptic number.
103120023100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103120023100 is an abundant number, since it is smaller than the sum of its proper divisors (120650427244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103120023100 is a wasteful number, since it uses less digits than its factorization.
103120023100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1031200245 (or 1031200238 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 103120023100 its reverse (1320021301), we get a palindrome (104440044401).
The spelling of 103120023100 in words is "one hundred three billion, one hundred twenty million, twenty-three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •