Base | Representation |
---|---|
bin | 111000111101100011… |
… | …000100110110000000 |
3 | 12211212111101000000010 |
4 | 320331203010312000 |
5 | 2000230002202300 |
6 | 44033021024520 |
7 | 4263440446650 |
oct | 707543046600 |
9 | 184774330003 |
10 | 61162147200 |
11 | 23a3648a4a0 |
12 | ba2b0b5140 |
13 | 59c945a25b |
14 | 2d62d6c360 |
15 | 18ce7b2a50 |
hex | e3d8c4d80 |
61162147200 has 768 divisors, whose sum is σ = 254048739840. Its totient is φ = 12563251200.
The previous prime is 61162147199. The next prime is 61162147229. The reversal of 61162147200 is 274126116.
It is a super-2 number, since 2×611621472002 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
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, 71701974 + ... + 71702826.
It is an arithmetic number, because the mean of its divisors is an integer number (330792630).
Almost surely, 261162147200 is an apocalyptic number.
61162147200 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 61162147200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (127024369920).
61162147200 is an abundant number, since it is smaller than the sum of its proper divisors (192886592640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61162147200 is a wasteful number, since it uses less digits than its factorization.
61162147200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 995 (or 978 counting only the distinct ones).
The product of its (nonzero) digits is 4032, while the sum is 30.
The spelling of 61162147200 in words is "sixty-one billion, one hundred sixty-two million, one hundred forty-seven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •