Base | Representation |
---|---|
bin | 111001011011111101… |
… | …000100011101001000 |
3 | 12220012001021022200020 |
4 | 321123331010131020 |
5 | 2002301100342312 |
6 | 44155402540440 |
7 | 4312203466164 |
oct | 713375043510 |
9 | 186161238606 |
10 | 61672277832 |
11 | 24178436160 |
12 | bb51b07720 |
13 | 5a7b04b4b9 |
14 | 2db09ddca4 |
15 | 190e47c78c |
hex | e5bf44748 |
61672277832 has 128 divisors (see below), whose sum is σ = 175897128960. Its totient is φ = 17836600320.
The previous prime is 61672277813. The next prime is 61672277893. The reversal of 61672277832 is 23877227616.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors.
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 31 ways as a sum of consecutive naturals, for example, 2800368 + ... + 2822304.
It is an arithmetic number, because the mean of its divisors is an integer number (1374196320).
Almost surely, 261672277832 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 61672277832, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (87948564480).
61672277832 is an abundant number, since it is smaller than the sum of its proper divisors (114224851128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61672277832 is a wasteful number, since it uses less digits than its factorization.
61672277832 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22443 (or 22439 counting only the distinct ones).
The product of its digits is 2370816, while the sum is 51.
The spelling of 61672277832 in words is "sixty-one billion, six hundred seventy-two million, two hundred seventy-seven thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •