Base | Representation |
---|---|
bin | 111010101101011111… |
… | …111010011000101101 |
3 | 20000201101120102000000 |
4 | 322231133322120231 |
5 | 2013101313204000 |
6 | 44543233454513 |
7 | 4361125161612 |
oct | 725537723055 |
9 | 200641512000 |
10 | 63040366125 |
11 | 2480a709140 |
12 | 10274111439 |
13 | 5c38605ab9 |
14 | 30a05a6509 |
15 | 198e61c000 |
hex | ead7fa62d |
63040366125 has 224 divisors, whose sum is σ = 130917406464. Its totient is φ = 30034800000.
The previous prime is 63040366121. The next prime is 63040366153. The reversal of 63040366125 is 52166304036.
63040366125 is a `hidden beast` number, since 6 + 3 + 0 + 4 + 0 + 36 + 612 + 5 = 666.
It is not a de Polignac number, because 63040366125 - 22 = 63040366121 is a prime.
It is a super-2 number, since 2×630403661252 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 63040366125.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (63040366121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 223 ways as a sum of consecutive naturals, for example, 61144360 + ... + 61145390.
Almost surely, 263040366125 is an apocalyptic number.
It is an amenable number.
63040366125 is an abundant number, since it is smaller than the sum of its proper divisors (67877040339).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
63040366125 is a wasteful number, since it uses less digits than its factorization.
63040366125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1136 (or 1111 counting only the distinct ones).
The product of its (nonzero) digits is 77760, while the sum is 36.
The spelling of 63040366125 in words is "sixty-three billion, forty million, three hundred sixty-six thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •