Base | Representation |
---|---|
bin | 101011010100000000… |
… | …100000101001100000 |
3 | 11110001010022212110120 |
4 | 223110000200221200 |
5 | 1230221140421410 |
6 | 33210445200240 |
7 | 3234322243350 |
oct | 532400405140 |
9 | 143033285416 |
10 | 46506576480 |
11 | 187a5828281 |
12 | 901ab60080 |
13 | 4502096910 |
14 | 23727a4b60 |
15 | 1322d36570 |
hex | ad4020a60 |
46506576480 has 384 divisors, whose sum is σ = 182070540288. Its totient is φ = 9716170752.
The previous prime is 46506576443. The next prime is 46506576491. The reversal of 46506576480 is 8467560564.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 4493872 + ... + 4504208.
It is an arithmetic number, because the mean of its divisors is an integer number (474142032).
Almost surely, 246506576480 is an apocalyptic number.
46506576480 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 46506576480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (91035270144).
46506576480 is an abundant number, since it is smaller than the sum of its proper divisors (135563963808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
46506576480 is a wasteful number, since it uses less digits than its factorization.
46506576480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10478 (or 10470 counting only the distinct ones).
The product of its (nonzero) digits is 4838400, while the sum is 51.
The spelling of 46506576480 in words is "forty-six billion, five hundred six million, five hundred seventy-six thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •