Base | Representation |
---|---|
bin | 101011101100111010… |
… | …111110111011100000 |
3 | 11111010020211112101101 |
4 | 223230322332323200 |
5 | 1232100141324143 |
6 | 33320140044144 |
7 | 3250556106454 |
oct | 535472767340 |
9 | 144106745341 |
10 | 46924558048 |
11 | 1899a764a95 |
12 | 9116b33654 |
13 | 456a8629a4 |
14 | 23b20ca664 |
15 | 134989cb4d |
hex | aecebeee0 |
46924558048 has 48 divisors (see below), whose sum is σ = 96640369056. Its totient is φ = 22386073600.
The previous prime is 46924557971. The next prime is 46924558067. The reversal of 46924558048 is 84085542964.
It is a Smith number, since the sum of its digits (55) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 46924558048.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 215640 + ... + 374632.
It is an arithmetic number, because the mean of its divisors is an integer number (2013341022).
Almost surely, 246924558048 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 46924558048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (48320184528).
46924558048 is an abundant number, since it is smaller than the sum of its proper divisors (49715811008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
46924558048 is a wasteful number, since it uses less digits than its factorization.
46924558048 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 159427 (or 159419 counting only the distinct ones).
The product of its (nonzero) digits is 11059200, while the sum is 55.
The spelling of 46924558048 in words is "forty-six billion, nine hundred twenty-four million, five hundred fifty-eight thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •