Base | Representation |
---|---|
bin | 10111011100010101010100… |
… | …101101010101010010011100 |
3 | 111112001110120101122122212220 |
4 | 113130111110231111102130 |
5 | 102003211110421012200 |
6 | 1003140242253425340 |
7 | 30500611266414351 |
oct | 2734252455252234 |
9 | 445043511578786 |
10 | 103102111110300 |
11 | 2a9403a5945405 |
12 | b691a6849b250 |
13 | 456b644963473 |
14 | 1b662512a8628 |
15 | bdbdc875c4a0 |
hex | 5dc554b5549c |
103102111110300 has 72 divisors (see below), whose sum is σ = 308595284314800. Its totient is φ = 26545830904320.
The previous prime is 103102111110289. The next prime is 103102111110371. The reversal of 103102111110300 is 3011111201301.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 103102111110300.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5925399985 + ... + 5925417384.
Almost surely, 2103102111110300 is an apocalyptic number.
103102111110300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103102111110300 is an abundant number, since it is smaller than the sum of its proper divisors (205493173204500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103102111110300 is a wasteful number, since it uses less digits than its factorization.
103102111110300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11850817415 (or 11850817408 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 15.
Adding to 103102111110300 its reverse (3011111201301), we get a palindrome (106113222311601).
The spelling of 103102111110300 in words is "one hundred three trillion, one hundred two billion, one hundred eleven million, one hundred ten thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •