Base | Representation |
---|---|
bin | 111000110111101101… |
… | …110100111001111000 |
3 | 12211121200020221220020 |
4 | 320313231310321320 |
5 | 2000024430132300 |
6 | 44015203530440 |
7 | 4261142001366 |
oct | 706755647170 |
9 | 184550227806 |
10 | 61064302200 |
11 | 23996230060 |
12 | ba02389a20 |
13 | 59b20bc5c5 |
14 | 2d53d7c636 |
15 | 18c5dd68a0 |
hex | e37b74e78 |
61064302200 has 384 divisors, whose sum is σ = 214640547840. Its totient is φ = 14227200000.
The previous prime is 61064302099. The next prime is 61064302213. The reversal of 61064302200 is 220346016.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 32121250 + ... + 32123150.
It is an arithmetic number, because the mean of its divisors is an integer number (558959760).
Almost surely, 261064302200 is an apocalyptic number.
61064302200 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 61064302200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (107320273920).
61064302200 is an abundant number, since it is smaller than the sum of its proper divisors (153576245640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61064302200 is a wasteful number, since it uses less digits than its factorization.
61064302200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2119 (or 2110 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 61064302200 its reverse (220346016), we get a palindrome (61284648216).
The spelling of 61064302200 in words is "sixty-one billion, sixty-four million, three hundred two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •