Base | Representation |
---|---|
bin | 1011000001111… |
… | …1100001001000 |
3 | 10020001120121212 |
4 | 2300133201020 |
5 | 43321011230 |
6 | 4331352252 |
7 | 1101154403 |
oct | 260374110 |
9 | 106046555 |
10 | 46266440 |
11 | 24130730 |
12 | 135b2688 |
13 | 977bbbc |
14 | 6204d3a |
15 | 40dd895 |
hex | 2c1f848 |
46266440 has 64 divisors (see below), whose sum is σ = 115240320. Its totient is φ = 16576000.
The previous prime is 46266433. The next prime is 46266497. The reversal of 46266440 is 4466264.
It is a junction number, because it is equal to n+sod(n) for n = 46266397 and 46266406.
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, 30500 + ... + 31980.
It is an arithmetic number, because the mean of its divisors is an integer number (1800630).
Almost surely, 246266440 is an apocalyptic number.
46266440 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 46266440, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (57620160).
46266440 is an abundant number, since it is smaller than the sum of its proper divisors (68973880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
46266440 is a wasteful number, since it uses less digits than its factorization.
46266440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1574 (or 1570 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 32.
The square root of 46266440 is about 6801.9438398152. The cubic root of 46266440 is about 358.9952436114.
The spelling of 46266440 in words is "forty-six million, two hundred sixty-six thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •