Base | Representation |
---|---|
bin | 111001011111001101… |
… | …010100001100111000 |
3 | 12220022211222210200200 |
4 | 321133031110030320 |
5 | 2002404034241110 |
6 | 44205033002200 |
7 | 4313435503050 |
oct | 713715241470 |
9 | 186284883620 |
10 | 61726868280 |
11 | 241a6231830 |
12 | bb68253360 |
13 | 5a8945313c |
14 | 2db7d70560 |
15 | 19141626c0 |
hex | e5f354338 |
61726868280 has 384 divisors, whose sum is σ = 250581427200. Its totient is φ = 12802406400.
The previous prime is 61726868239. The next prime is 61726868297. The reversal of 61726868280 is 8286862716.
It is a congruent number.
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 95 ways as a sum of consecutive naturals, for example, 17489556 + ... + 17493084.
It is an arithmetic number, because the mean of its divisors is an integer number (652555800).
Almost surely, 261726868280 is an apocalyptic number.
61726868280 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 61726868280, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (125290713600).
61726868280 is an abundant number, since it is smaller than the sum of its proper divisors (188854558920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61726868280 is a wasteful number, since it uses less digits than its factorization.
61726868280 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4195 (or 4188 counting only the distinct ones).
The product of its (nonzero) digits is 3096576, while the sum is 54.
The spelling of 61726868280 in words is "sixty-one billion, seven hundred twenty-six million, eight hundred sixty-eight thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •