Base | Representation |
---|---|
bin | 11011110001110000111111… |
… | …11010000010000000000000 |
3 | 22000021112100100001101221100 |
4 | 31320320133322002000000 |
5 | 31001243112402034302 |
6 | 333525222233454400 |
7 | 15603066364533546 |
oct | 1570703772020000 |
9 | 260245310041840 |
10 | 61083560189952 |
11 | 18510435311523 |
12 | 6a264a0871400 |
13 | 28112027309c1 |
14 | 11126626a3d96 |
15 | 70ddcc133d1c |
hex | 378e1fe82000 |
61083560189952 has 168 divisors, whose sum is σ = 179782158358764. Its totient is φ = 19977012117504.
The previous prime is 61083560189947. The next prime is 61083560190007. The reversal of 61083560189952 is 25998106538016.
61083560189952 is a `hidden beast` number, since 6 + 1 + 0 + 8 + 3 + 560 + 18 + 9 + 9 + 52 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 60606598680576 + 476961509376 = 7785024^2 + 690624^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 61083560189952.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3908443 + ... + 11723610.
Almost surely, 261083560189952 is an apocalyptic number.
It is an amenable number.
61083560189952 is an abundant number, since it is smaller than the sum of its proper divisors (118698598168812).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61083560189952 is a wasteful number, since it uses less digits than its factorization.
61083560189952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15632138 (or 15632111 counting only the distinct ones).
The product of its (nonzero) digits is 27993600, while the sum is 63.
The spelling of 61083560189952 in words is "sixty-one trillion, eighty-three billion, five hundred sixty million, one hundred eighty-nine thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •