Base | Representation |
---|---|
bin | 1001101001011… |
… | …1011001100100 |
3 | 2211010212221111 |
4 | 2122113121210 |
5 | 40324403040 |
6 | 4003154404 |
7 | 1000645510 |
oct | 232273144 |
9 | 84125844 |
10 | 40466020 |
11 | 209297a1 |
12 | 11675a04 |
13 | 84ca9ba |
14 | 5535140 |
15 | 3844dea |
hex | 2697664 |
40466020 has 48 divisors (see below), whose sum is σ = 100477440. Its totient is φ = 13394304.
The previous prime is 40466003. The next prime is 40466033. The reversal of 40466020 is 2066404.
40466020 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 40465982 and 40466000.
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 15 ways as a sum of consecutive naturals, for example, 924 + ... + 9043.
It is an arithmetic number, because the mean of its divisors is an integer number (2093280).
Almost surely, 240466020 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 40466020, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (50238720).
40466020 is an abundant number, since it is smaller than the sum of its proper divisors (60011420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40466020 is a wasteful number, since it uses less digits than its factorization.
40466020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10012 (or 10010 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 22.
The square root of 40466020 is about 6361.2907495256. The cubic root of 40466020 is about 343.3182029549.
The spelling of 40466020 in words is "forty million, four hundred sixty-six thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •