Base | Representation |
---|---|
bin | 1001001001110100111111… |
… | …1000010111010010001001 |
3 | 1022122011002201112210222122 |
4 | 2102131033320113102021 |
5 | 2304343442312100100 |
6 | 33223313245101025 |
7 | 2056063263105512 |
oct | 222351770272211 |
9 | 38564081483878 |
10 | 10064448550025 |
11 | 3230343910601 |
12 | 1166683557775 |
13 | 5800c5416b1c |
14 | 26b19c737a09 |
15 | 126becebe985 |
hex | 9274fe17489 |
10064448550025 has 12 divisors (see below), whose sum is σ = 12482248626624. Its totient is φ = 8050054050000.
The previous prime is 10064448550021. The next prime is 10064448550069. The reversal of 10064448550025 is 52005584446001.
10064448550025 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 10064448550025 - 22 = 10064448550021 is a prime.
It is a super-2 number, since 2×100644485500252 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10064448550021) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 37483301 + ... + 37750850.
It is an arithmetic number, because the mean of its divisors is an integer number (1040187385552).
Almost surely, 210064448550025 is an apocalyptic number.
It is an amenable number.
10064448550025 is a deficient number, since it is larger than the sum of its proper divisors (2417800076599).
10064448550025 is an equidigital number, since it uses as much as digits as its factorization.
10064448550025 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 75239512 (or 75239507 counting only the distinct ones).
The product of its (nonzero) digits is 768000, while the sum is 44.
The spelling of 10064448550025 in words is "ten trillion, sixty-four billion, four hundred forty-eight million, five hundred fifty thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •