Base | Representation |
---|---|
bin | 100100011011010011110… |
… | …1011001110001100001001 |
3 | 122201121112002222100122100 |
4 | 1020312213223032030021 |
5 | 1124011202201301400 |
6 | 14351533102544013 |
7 | 1024463333033325 |
oct | 110664753161411 |
9 | 18647462870570 |
10 | 5006450025225 |
11 | 1660250580a20 |
12 | 68a349b98009 |
13 | 2a414c46833c |
14 | 13445625c985 |
15 | 8a368b00100 |
hex | 48da7ace309 |
5006450025225 has 72 divisors (see below), whose sum is σ = 9782896792032. Its totient is φ = 2427221606400.
The previous prime is 5006450025173. The next prime is 5006450025229. The reversal of 5006450025225 is 5225200546005.
5006450025225 is a `hidden beast` number, since 5 + 0 + 0 + 645 + 0 + 0 + 2 + 5 + 2 + 2 + 5 = 666.
It is not a de Polignac number, because 5006450025225 - 210 = 5006450024201 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5006450025225.
It is not an unprimeable number, because it can be changed into a prime (5006450025229) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 48104094 + ... + 48208056.
It is an arithmetic number, because the mean of its divisors is an integer number (135873566556).
Almost surely, 25006450025225 is an apocalyptic number.
5006450025225 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
5006450025225 is a deficient number, since it is larger than the sum of its proper divisors (4776446766807).
5006450025225 is a wasteful number, since it uses less digits than its factorization.
5006450025225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123447 (or 123439 counting only the distinct ones).
The product of its (nonzero) digits is 120000, while the sum is 36.
The spelling of 5006450025225 in words is "five trillion, six billion, four hundred fifty million, twenty-five thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •