Base | Representation |
---|---|
bin | 1010111110110… |
… | …0010010000000 |
3 | 10012122220202010 |
4 | 2233230102000 |
5 | 43242302301 |
6 | 4323052520 |
7 | 1066321506 |
oct | 257542200 |
9 | 105586663 |
10 | 46056576 |
11 | 23aa7a95 |
12 | 13511140 |
13 | 9707517 |
14 | 618c676 |
15 | 409b5d6 |
hex | 2bec480 |
46056576 has 128 divisors (see below), whose sum is σ = 130429440. Its totient is φ = 14376960.
The previous prime is 46056559. The next prime is 46056581. The reversal of 46056576 is 67565064.
It is a tau number, because it is divible by the number of its divisors (128).
It is a Smith number, since the sum of its digits (39) coincides with the sum of the digits of its prime factors.
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 15 ways as a sum of consecutive naturals, for example, 630876 + ... + 630948.
It is an arithmetic number, because the mean of its divisors is an integer number (1018980).
Almost surely, 246056576 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 46056576, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (65214720).
46056576 is an abundant number, since it is smaller than the sum of its proper divisors (84372864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
46056576 is a wasteful number, since it uses less digits than its factorization.
46056576 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 174 (or 162 counting only the distinct ones).
The product of its (nonzero) digits is 151200, while the sum is 39.
The square root of 46056576 is about 6786.4995395270. The cubic root of 46056576 is about 358.4516214973.
The spelling of 46056576 in words is "forty-six million, fifty-six thousand, five hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •