Base | Representation |
---|---|
bin | 10100001101000110… |
… | …11110001010011101 |
3 | 1000222222021000010110 |
4 | 22012203132022131 |
5 | 134203412131000 |
6 | 4552213000233 |
7 | 532544131641 |
oct | 120643361235 |
9 | 30888230113 |
10 | 10847380125 |
11 | 466707726a |
12 | 2128923079 |
13 | 103b41c12a |
14 | 74c902c21 |
15 | 437493850 |
hex | 2868de29d |
10847380125 has 16 divisors (see below), whose sum is σ = 18050041152. Its totient is φ = 5785269200.
The previous prime is 10847380123. The next prime is 10847380147. The reversal of 10847380125 is 52108374801.
10847380125 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10847380125 - 21 = 10847380123 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10847380123) 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 15 ways as a sum of consecutive naturals, for example, 14462799 + ... + 14463548.
It is an arithmetic number, because the mean of its divisors is an integer number (1128127572).
Almost surely, 210847380125 is an apocalyptic number.
10847380125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10847380125 is a deficient number, since it is larger than the sum of its proper divisors (7202661027).
10847380125 is an equidigital number, since it uses as much as digits as its factorization.
10847380125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28926365 (or 28926355 counting only the distinct ones).
The product of its (nonzero) digits is 53760, while the sum is 39.
The spelling of 10847380125 in words is "ten billion, eight hundred forty-seven million, three hundred eighty thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •