Base | Representation |
---|---|
bin | 10010101000001001… |
… | …11110011110011111 |
3 | 221210221202022120210 |
4 | 21110010332132133 |
5 | 130440113301330 |
6 | 4332201543503 |
7 | 502552030122 |
oct | 112404763637 |
9 | 27727668523 |
10 | 10000525215 |
11 | 427204367a |
12 | 1b311a4b93 |
13 | c34b42555 |
14 | 6ac25c3b9 |
15 | 3d7e638b0 |
hex | 25413e79f |
10000525215 has 16 divisors (see below), whose sum is σ = 16302744288. Its totient is φ = 5232978816.
The previous prime is 10000525169. The next prime is 10000525217. The reversal of 10000525215 is 51252500001.
It is not a de Polignac number, because 10000525215 - 211 = 10000523167 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10000525191 and 10000525200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10000525217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6288844 + ... + 6290433.
It is an arithmetic number, because the mean of its divisors is an integer number (1018921518).
Almost surely, 210000525215 is an apocalyptic number.
10000525215 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10000525215 is a deficient number, since it is larger than the sum of its proper divisors (6302219073).
10000525215 is a wasteful number, since it uses less digits than its factorization.
10000525215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12579338.
The product of its (nonzero) digits is 500, while the sum is 21.
The spelling of 10000525215 in words is "ten billion, five hundred twenty-five thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •