Base | Representation |
---|---|
bin | 111010110011001101… |
… | …111001011101101100 |
3 | 20000222002002201012200 |
4 | 322303031321131230 |
5 | 2013300343311202 |
6 | 45000542101500 |
7 | 4363401520020 |
oct | 726315713554 |
9 | 200862081180 |
10 | 63136307052 |
11 | 24859887a65 |
12 | 102a027a890 |
13 | 5c52457b90 |
14 | 30ad21c380 |
15 | 1997c6de1c |
hex | eb337976c |
63136307052 has 288 divisors, whose sum is σ = 199067860992. Its totient is φ = 16428883968.
The previous prime is 63136307023. The next prime is 63136307071. The reversal of 63136307052 is 25070363136.
63136307052 is a `hidden beast` number, since 6 + 3 + 13 + 630 + 7 + 0 + 5 + 2 = 666.
It is a super-3 number, since 3×631363070523 (a number of 33 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 63136306998 and 63136307016.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 109421388 + ... + 109421964.
Almost surely, 263136307052 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 63136307052, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (99533930496).
63136307052 is an abundant number, since it is smaller than the sum of its proper divisors (135931553940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
63136307052 is a wasteful number, since it uses less digits than its factorization.
63136307052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 997 (or 992 counting only the distinct ones).
The product of its (nonzero) digits is 68040, while the sum is 36.
The spelling of 63136307052 in words is "sixty-three billion, one hundred thirty-six million, three hundred seven thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •