Base | Representation |
---|---|
bin | 10111111010100… |
… | …111001110010100 |
3 | 1000222000011011001 |
4 | 113322213032110 |
5 | 1310204202410 |
6 | 103451553044 |
7 | 12641330530 |
oct | 2772471624 |
9 | 1028004131 |
10 | 401240980 |
11 | 196543318 |
12 | b245b784 |
13 | 651873ca |
14 | 3b408bc0 |
15 | 2535b33a |
hex | 17ea7394 |
401240980 has 72 divisors (see below), whose sum is σ = 1007701632. Its totient is φ = 131214336.
The previous prime is 401240977. The next prime is 401240999. The reversal of 401240980 is 89042104.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1136484 + ... + 1136836.
It is an arithmetic number, because the mean of its divisors is an integer number (13995856).
Almost surely, 2401240980 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 401240980, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (503850816).
401240980 is an abundant number, since it is smaller than the sum of its proper divisors (606460652).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
401240980 is a wasteful number, since it uses less digits than its factorization.
401240980 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 745 (or 390 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 28.
The square root of 401240980 is about 20031.0004742649. Note that the first 3 decimals coincide. The cubic root of 401240980 is about 737.5674813289.
The spelling of 401240980 in words is "four hundred one million, two hundred forty thousand, nine hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •