Base | Representation |
---|---|
bin | 101101001000101101… |
… | …000101000110110000 |
3 | 11122002120100111000211 |
4 | 231020231011012300 |
5 | 1243223342322300 |
6 | 34133024353504 |
7 | 3333664514653 |
oct | 551055050660 |
9 | 148076314024 |
10 | 48464417200 |
11 | 1960a999a61 |
12 | 9486775894 |
13 | 475489c654 |
14 | 24ba80789a |
15 | 13d9b6c4ba |
hex | b48b451b0 |
48464417200 has 240 divisors, whose sum is σ = 128973888000. Its totient is φ = 17426949120.
The previous prime is 48464417153. The next prime is 48464417201. The reversal of 48464417200 is 271446484.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is not an unprimeable number, because it can be changed into a prime (48464417201) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 13001737 + ... + 13005463.
It is an arithmetic number, because the mean of its divisors is an integer number (537391200).
Almost surely, 248464417200 is an apocalyptic number.
48464417200 is a gapful number since it is divisible by the number (40) 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 48464417200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (64486944000).
48464417200 is an abundant number, since it is smaller than the sum of its proper divisors (80509470800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48464417200 is a wasteful number, since it uses less digits than its factorization.
48464417200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3852 (or 3841 counting only the distinct ones).
The product of its (nonzero) digits is 172032, while the sum is 40.
The spelling of 48464417200 in words is "forty-eight billion, four hundred sixty-four million, four hundred seventeen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •