Base | Representation |
---|---|
bin | 11000001101101… |
… | …111110100101100 |
3 | 1001022102222202100 |
4 | 120031233310230 |
5 | 1313000210230 |
6 | 104151255100 |
7 | 13032061365 |
oct | 3015576454 |
9 | 1038388670 |
10 | 406256940 |
11 | 199359941 |
12 | b407a490 |
13 | 6622252b |
14 | 3bd52b6c |
15 | 259ec660 |
hex | 1836fd2c |
406256940 has 144 divisors (see below), whose sum is σ = 1284192000. Its totient is φ = 103832064.
The previous prime is 406256887. The next prime is 406256941. The reversal of 406256940 is 49652604.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 406256895 and 406256904.
It is not an unprimeable number, because it can be changed into a prime (406256941) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1163886 + ... + 1164234.
It is an arithmetic number, because the mean of its divisors is an integer number (8918000).
Almost surely, 2406256940 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 406256940, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (642096000).
406256940 is an abundant number, since it is smaller than the sum of its proper divisors (877935060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
406256940 is a wasteful number, since it uses less digits than its factorization.
406256940 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 616 (or 611 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 36.
The square root of 406256940 is about 20155.8165302227. The cubic root of 406256940 is about 740.6282344568.
The spelling of 406256940 in words is "four hundred six million, two hundred fifty-six thousand, nine hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •