Base | Representation |
---|---|
bin | 110000100010000000… |
… | …0101100100110111110 |
3 | 100222000021210011212002 |
4 | 1201010000230212332 |
5 | 3201420340423020 |
6 | 115513401342302 |
7 | 10346450332010 |
oct | 1410400544676 |
9 | 328007704762 |
10 | 104220248510 |
11 | 40221682294 |
12 | 18247197992 |
13 | 9a9bc57a01 |
14 | 50897481b0 |
15 | 2a9e9b8975 |
hex | 184402c9be |
104220248510 has 32 divisors (see below), whose sum is σ = 218029777920. Its totient is φ = 35127016992.
The previous prime is 104220248507. The next prime is 104220248513. The reversal of 104220248510 is 15842022401.
It is an interprime number because it is at equal distance from previous prime (104220248507) and next prime (104220248513).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104220248513) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12613334 + ... + 12621593.
It is an arithmetic number, because the mean of its divisors is an integer number (6813430560).
Almost surely, 2104220248510 is an apocalyptic number.
104220248510 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
104220248510 is an abundant number, since it is smaller than the sum of its proper divisors (113809529410).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104220248510 is a wasteful number, since it uses less digits than its factorization.
104220248510 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25235000.
The product of its (nonzero) digits is 5120, while the sum is 29.
The spelling of 104220248510 in words is "one hundred four billion, two hundred twenty million, two hundred forty-eight thousand, five hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •