Base | Representation |
---|---|
bin | 10011000000000111… |
… | …01110011110011101 |
3 | 222022221222010020212 |
4 | 21200003232132131 |
5 | 131343042233000 |
6 | 4404142022205 |
7 | 510542344562 |
oct | 114003563635 |
9 | 28287863225 |
10 | 10201524125 |
11 | 4365549081 |
12 | 1b88577965 |
13 | c67689410 |
14 | 6cac20869 |
15 | 3ea918c35 |
hex | 2600ee79d |
10201524125 has 16 divisors (see below), whose sum is σ = 13710850608. Its totient is φ = 7533432000.
The previous prime is 10201524119. The next prime is 10201524133. The reversal of 10201524125 is 52142510201.
10201524125 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 8 ways, for example, as 2771601316 + 7429922809 = 52646^2 + 86197^2 .
It is not a de Polignac number, because 10201524125 - 28 = 10201523869 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10201524125.
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, 3137306 + ... + 3140555.
It is an arithmetic number, because the mean of its divisors is an integer number (856928163).
Almost surely, 210201524125 is an apocalyptic number.
It is an amenable number.
10201524125 is a deficient number, since it is larger than the sum of its proper divisors (3509326483).
10201524125 is an equidigital number, since it uses as much as digits as its factorization.
10201524125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6277889 (or 6277879 counting only the distinct ones).
The product of its (nonzero) digits is 800, while the sum is 23.
The spelling of 10201524125 in words is "ten billion, two hundred one million, five hundred twenty-four thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •