Base | Representation |
---|---|
bin | 111000110110100010… |
… | …000000000000000000 |
3 | 12211120021212002002200 |
4 | 320312202000000000 |
5 | 2000004333042304 |
6 | 44013213513200 |
7 | 4260511022454 |
oct | 706642000000 |
9 | 184507762080 |
10 | 61044424704 |
11 | 23985a9387a |
12 | b9b77a2800 |
13 | 59aac4cb83 |
14 | 2d51486664 |
15 | 18c42abe39 |
hex | e36880000 |
61044424704 has 240 divisors, whose sum is σ = 186969311100. Its totient is φ = 19126026240.
The previous prime is 61044424703. The next prime is 61044424711. The reversal of 61044424704 is 40742444016.
It can be written as a sum of positive squares in 2 ways, for example, as 58154287104 + 2890137600 = 241152^2 + 53760^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (61044424703) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 80215684 + ... + 80216444.
Almost surely, 261044424704 is an apocalyptic number.
61044424704 is a gapful number since it is divisible by the number (64) 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 61044424704, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (93484655550).
61044424704 is an abundant number, since it is smaller than the sum of its proper divisors (125924886396).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61044424704 is an frugal number, since it uses more digits than its factorization.
61044424704 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 822 (or 783 counting only the distinct ones).
The product of its (nonzero) digits is 86016, while the sum is 36.
The spelling of 61044424704 in words is "sixty-one billion, forty-four million, four hundred twenty-four thousand, seven hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •