Base | Representation |
---|---|
bin | 1001000110011000000101… |
… | …1010100110011101011101 |
3 | 1022102111001002222201222000 |
4 | 2101212001122212131131 |
5 | 2302411021404112100 |
6 | 33140145200512513 |
7 | 2051563642236435 |
oct | 221460132463535 |
9 | 38374032881860 |
10 | 10005150066525 |
11 | 3208184419249 |
12 | 115709461b739 |
13 | 57763510a373 |
14 | 2683750d52c5 |
15 | 1253cc13d900 |
hex | 919816a675d |
10005150066525 has 24 divisors (see below), whose sum is σ = 18379831234560. Its totient is φ = 5336080035120.
The previous prime is 10005150066487. The next prime is 10005150066529. The reversal of 10005150066525 is 52566005150001.
It is not a de Polignac number, because 10005150066525 - 27 = 10005150066397 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 10005150066525.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10005150066529) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7411221597 + ... + 7411222946.
It is an arithmetic number, because the mean of its divisors is an integer number (765826301440).
Almost surely, 210005150066525 is an apocalyptic number.
10005150066525 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10005150066525 is a deficient number, since it is larger than the sum of its proper divisors (8374681168035).
10005150066525 is a wasteful number, since it uses less digits than its factorization.
10005150066525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14822444562 (or 14822444551 counting only the distinct ones).
The product of its (nonzero) digits is 45000, while the sum is 36.
The spelling of 10005150066525 in words is "ten trillion, five billion, one hundred fifty million, sixty-six thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •