Base | Representation |
---|---|
bin | 1011001011100… |
… | …0000110101000 |
3 | 10021020022221201 |
4 | 2302320012220 |
5 | 44001011212 |
6 | 4353013544 |
7 | 1106366500 |
oct | 262700650 |
9 | 107208851 |
10 | 46891432 |
11 | 24518255 |
12 | 138542b4 |
13 | 993a513 |
14 | 6328a00 |
15 | 41b3b57 |
hex | 2cb81a8 |
46891432 has 96 divisors (see below), whose sum is σ = 108776520. Its totient is φ = 18869760.
The previous prime is 46891421. The next prime is 46891447. The reversal of 46891432 is 23419864.
It can be written as a sum of positive squares in 4 ways, for example, as 41293476 + 5597956 = 6426^2 + 2366^2 .
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a junction number, because it is equal to n+sod(n) for n = 46891391 and 46891400.
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 23 ways as a sum of consecutive naturals, for example, 768682 + ... + 768742.
Almost surely, 246891432 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 46891432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (54388260).
46891432 is an abundant number, since it is smaller than the sum of its proper divisors (61885088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
46891432 is a wasteful number, since it uses less digits than its factorization.
46891432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 171 (or 160 counting only the distinct ones).
The product of its digits is 41472, while the sum is 37.
The square root of 46891432 is about 6847.7318872748. The cubic root of 46891432 is about 360.6045192902.
The spelling of 46891432 in words is "forty-six million, eight hundred ninety-one thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •