Base | Representation |
---|---|
bin | 111001001111010011… |
… | …110010101000001000 |
3 | 12212122021002002222200 |
4 | 321033103302220020 |
5 | 2001332243132222 |
6 | 44122343520200 |
7 | 4304016326250 |
oct | 711723625010 |
9 | 185567062880 |
10 | 61460130312 |
11 | 24079706629 |
12 | bab2a59060 |
13 | 5a46100019 |
14 | 2d90778960 |
15 | 18eaa23eac |
hex | e4f4f2a08 |
61460130312 has 192 divisors, whose sum is σ = 191437733760. Its totient is φ = 17449344000.
The previous prime is 61460130301. The next prime is 61460130359. The reversal of 61460130312 is 21303106416.
61460130312 is a `hidden beast` number, since 6 + 14 + 601 + 30 + 3 + 12 = 666.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 100260918 + ... + 100261530.
It is an arithmetic number, because the mean of its divisors is an integer number (997071530).
Almost surely, 261460130312 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 61460130312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (95718866880).
61460130312 is an abundant number, since it is smaller than the sum of its proper divisors (129977603448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61460130312 is a wasteful number, since it uses less digits than its factorization.
61460130312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1564 (or 1557 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
Adding to 61460130312 its reverse (21303106416), we get a palindrome (82763236728).
The spelling of 61460130312 in words is "sixty-one billion, four hundred sixty million, one hundred thirty thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •