Base | Representation |
---|---|
bin | 111001001111100000… |
… | …011001010101000000 |
3 | 12212122111021222120020 |
4 | 321033200121111000 |
5 | 2001334114401220 |
6 | 44122542413440 |
7 | 4304056400523 |
oct | 711740312500 |
9 | 185574258506 |
10 | 61463434560 |
11 | 24080563110 |
12 | bab3b91280 |
13 | 5a469b8cb8 |
14 | 2d90d98bba |
15 | 18eae78040 |
hex | e4f819540 |
61463434560 has 224 divisors, whose sum is σ = 218080888704. Its totient is φ = 14536704000.
The previous prime is 61463434537. The next prime is 61463434577. The reversal of 61463434560 is 6543436416.
It is a super-2 number, since 2×614634345602 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 361980 + ... + 503940.
It is an arithmetic number, because the mean of its divisors is an integer number (973575396).
Almost surely, 261463434560 is an apocalyptic number.
61463434560 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 61463434560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (109040444352).
61463434560 is an abundant number, since it is smaller than the sum of its proper divisors (156617454144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61463434560 is a wasteful number, since it uses less digits than its factorization.
61463434560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 142033 (or 142023 counting only the distinct ones).
The product of its (nonzero) digits is 622080, while the sum is 42.
The spelling of 61463434560 in words is "sixty-one billion, four hundred sixty-three million, four hundred thirty-four thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •