Base | Representation |
---|---|
bin | 1001110000100… |
… | …1001110101110 |
3 | 2212000120112000 |
4 | 2130021032232 |
5 | 40434313040 |
6 | 4021153130 |
7 | 1004630031 |
oct | 234111656 |
9 | 85016460 |
10 | 40932270 |
11 | 21118025 |
12 | 1185b7a6 |
13 | 8631ca2 |
14 | 5617018 |
15 | 38d8130 |
hex | 27093ae |
40932270 has 128 divisors (see below), whose sum is σ = 117504000. Its totient is φ = 10108800.
The previous prime is 40932247. The next prime is 40932299. The reversal of 40932270 is 7223904.
40932270 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 405220 + ... + 405320.
It is an arithmetic number, because the mean of its divisors is an integer number (918000).
Almost surely, 240932270 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 40932270, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (58752000).
40932270 is an abundant number, since it is smaller than the sum of its proper divisors (76571730).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40932270 is a wasteful number, since it uses less digits than its factorization.
40932270 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 215 (or 209 counting only the distinct ones).
The product of its (nonzero) digits is 3024, while the sum is 27.
The square root of 40932270 is about 6397.8332269605. The cubic root of 40932270 is about 344.6317431643.
The spelling of 40932270 in words is "forty million, nine hundred thirty-two thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •