Base | Representation |
---|---|
bin | 111001001000100111… |
… | …100010011110111000 |
3 | 12212100102211112001122 |
4 | 321020213202132320 |
5 | 2001120023212202 |
6 | 44103253404412 |
7 | 4301154155540 |
oct | 711047423670 |
9 | 185312745048 |
10 | 61347866552 |
11 | 240212a9165 |
12 | ba81339708 |
13 | 5a28a8446b |
14 | 2d7d8b4320 |
15 | 18e0c4a9a2 |
hex | e489e27b8 |
61347866552 has 32 divisors (see below), whose sum is σ = 132342012000. Its totient is φ = 26115483264.
The previous prime is 61347866551. The next prime is 61347866557. The reversal of 61347866552 is 25566874316.
It is a happy number.
61347866552 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Smith number, since the sum of its digits (53) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 61347866494 and 61347866503.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61347866551) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3667823 + ... + 3684510.
It is an arithmetic number, because the mean of its divisors is an integer number (4135687875).
Almost surely, 261347866552 is an apocalyptic number.
It is an amenable number.
61347866552 is an abundant number, since it is smaller than the sum of its proper divisors (70994145448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61347866552 is a wasteful number, since it uses less digits than its factorization.
61347866552 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7352495 (or 7352491 counting only the distinct ones).
The product of its digits is 7257600, while the sum is 53.
The spelling of 61347866552 in words is "sixty-one billion, three hundred forty-seven million, eight hundred sixty-six thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •