Base | Representation |
---|---|
bin | 110000000011111010… |
… | …0101011010111010000 |
3 | 100212101220200211220110 |
4 | 1200013310223113100 |
5 | 3142333334332340 |
6 | 115225250241320 |
7 | 10312436321646 |
oct | 1400764532720 |
9 | 325356624813 |
10 | 103210464720 |
11 | 3a853686830 |
12 | 18004b86240 |
13 | 996a9a34cc |
14 | 4dd15b1196 |
15 | 2a41003680 |
hex | 1807d2b5d0 |
103210464720 has 80 divisors (see below), whose sum is σ = 349039035072. Its totient is φ = 25020718080.
The previous prime is 103210464683. The next prime is 103210464743. The reversal of 103210464720 is 27464012301.
103210464720 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 19544797 + ... + 19550076.
Almost surely, 2103210464720 is an apocalyptic number.
103210464720 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103210464720 is an abundant number, since it is smaller than the sum of its proper divisors (245828570352).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103210464720 is a wasteful number, since it uses less digits than its factorization.
103210464720 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39094900 (or 39094894 counting only the distinct ones).
The product of its (nonzero) digits is 8064, while the sum is 30.
The spelling of 103210464720 in words is "one hundred three billion, two hundred ten million, four hundred sixty-four thousand, seven hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •