Base | Representation |
---|---|
bin | 110000000000100111… |
… | …1101011001010110100 |
3 | 100212010020000210202101 |
4 | 1200001033223022310 |
5 | 3142122111220200 |
6 | 115210304551444 |
7 | 10306626254500 |
oct | 1400117531264 |
9 | 325106023671 |
10 | 103100101300 |
11 | 3a7a7357099 |
12 | 17b94022584 |
13 | 9950b71901 |
14 | 4dc0a83300 |
15 | 2a364a326a |
hex | 18013eb2b4 |
103100101300 has 108 divisors (see below), whose sum is σ = 271569805920. Its totient is φ = 33811673280.
The previous prime is 103100101253. The next prime is 103100101309. The reversal of 103100101300 is 3101001301.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103100101309) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 344710 + ... + 570109.
It is an arithmetic number, because the mean of its divisors is an integer number (2514535240).
Almost surely, 2103100101300 is an apocalyptic number.
103100101300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103100101300 is an abundant number, since it is smaller than the sum of its proper divisors (168469704620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103100101300 is a wasteful number, since it uses less digits than its factorization.
103100101300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 914870 (or 914856 counting only the distinct ones).
The product of its (nonzero) digits is 9, while the sum is 10.
Adding to 103100101300 its reverse (3101001301), we get a palindrome (106201102601).
Subtracting from 103100101300 its reverse (3101001301), we obtain a palindrome (99999099999).
The spelling of 103100101300 in words is "one hundred three billion, one hundred million, one hundred one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •