Base | Representation |
---|---|
bin | 1011000001000… |
… | …1000100001000 |
3 | 10012221120102021 |
4 | 2300101010020 |
5 | 43312112430 |
6 | 4330214224 |
7 | 1100516662 |
oct | 260210410 |
9 | 105846367 |
10 | 46207240 |
11 | 240a0202 |
12 | 13584374 |
13 | 975ac81 |
14 | 61cb532 |
15 | 40cb07a |
hex | 2c11108 |
46207240 has 64 divisors (see below), whose sum is σ = 110404800. Its totient is φ = 17356032.
The previous prime is 46207229. The next prime is 46207243. The reversal of 46207240 is 4270264.
It is not an unprimeable number, because it can be changed into a prime (46207243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 123694 + ... + 124066.
It is an arithmetic number, because the mean of its divisors is an integer number (1725075).
Almost surely, 246207240 is an apocalyptic number.
46207240 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 46207240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (55202400).
46207240 is an abundant number, since it is smaller than the sum of its proper divisors (64197560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
46207240 is a wasteful number, since it uses less digits than its factorization.
46207240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 566 (or 562 counting only the distinct ones).
The product of its (nonzero) digits is 2688, while the sum is 25.
The square root of 46207240 is about 6797.5907496701. The cubic root of 46207240 is about 358.8420613812.
The spelling of 46207240 in words is "forty-six million, two hundred seven thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •