Base | Representation |
---|---|
bin | 10011110000001010… |
… | …10110000101111101 |
3 | 1000101001102120202212 |
4 | 21320011112011331 |
5 | 133204234223400 |
6 | 4512141230205 |
7 | 523535425124 |
oct | 117005260575 |
9 | 30331376685 |
10 | 10604601725 |
11 | 4552026263 |
12 | 207b562365 |
13 | 1000037783 |
14 | 728586abb |
15 | 420ed9335 |
hex | 27815617d |
10604601725 has 24 divisors (see below), whose sum is σ = 13468280832. Its totient is φ = 8279835200.
The previous prime is 10604601719. The next prime is 10604601769. The reversal of 10604601725 is 52710640601.
10604601725 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 10604601725 - 212 = 10604597629 is a prime.
It is a super-2 number, since 2×106046017252 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10604601691 and 10604601700.
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 23 ways as a sum of consecutive naturals, for example, 232124 + ... + 274026.
It is an arithmetic number, because the mean of its divisors is an integer number (561178368).
Almost surely, 210604601725 is an apocalyptic number.
It is an amenable number.
10604601725 is a deficient number, since it is larger than the sum of its proper divisors (2863679107).
10604601725 is a wasteful number, since it uses less digits than its factorization.
10604601725 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42157 (or 42152 counting only the distinct ones).
The product of its (nonzero) digits is 10080, while the sum is 32.
The spelling of 10604601725 in words is "ten billion, six hundred four million, six hundred one thousand, seven hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •