Base | Representation |
---|---|
bin | 111001010001001101… |
… | …111100000000000000 |
3 | 12212201111022220010010 |
4 | 321101031330000000 |
5 | 2001413442302042 |
6 | 44125450104520 |
7 | 4304555440020 |
oct | 712115740000 |
9 | 185644286103 |
10 | 61492150272 |
11 | 24095796703 |
12 | bb0171b140 |
13 | 5a4c931547 |
14 | 2d94b11a80 |
15 | 18ed74b59c |
hex | e5137c000 |
61492150272 has 240 divisors, whose sum is σ = 188326890752. Its totient is φ = 17482383360.
The previous prime is 61492150267. The next prime is 61492150309. The reversal of 61492150272 is 27205129416.
It is a self number, because there is not a number n which added to its sum of digits gives 61492150272.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 107691747 + ... + 107692317.
Almost surely, 261492150272 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 61492150272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (94163445376).
61492150272 is an abundant number, since it is smaller than the sum of its proper divisors (126834740480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61492150272 is an equidigital number, since it uses as much as digits as its factorization.
61492150272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 922 (or 896 counting only the distinct ones).
The product of its (nonzero) digits is 60480, while the sum is 39.
Adding to 61492150272 its reverse (27205129416), we get a palindrome (88697279688).
The spelling of 61492150272 in words is "sixty-one billion, four hundred ninety-two million, one hundred fifty thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •