Base | Representation |
---|---|
bin | 11000001110110… |
… | …111111000111010 |
3 | 1001022222222200000 |
4 | 120032313320322 |
5 | 1313034131442 |
6 | 104201453430 |
7 | 13034431104 |
oct | 3016677072 |
9 | 1038888600 |
10 | 406552122 |
11 | 199540699 |
12 | b41a1276 |
13 | 662c69b2 |
14 | 3bdcc574 |
15 | 25a59d4c |
hex | 183b7e3a |
406552122 has 48 divisors (see below), whose sum is σ = 916118112. Its totient is φ = 135127440.
The previous prime is 406552103. The next prime is 406552151. The reversal of 406552122 is 221255604.
406552122 is a `hidden beast` number, since 4 + 0 + 655 + 2 + 1 + 2 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
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, 203613 + ... + 205599.
It is an arithmetic number, because the mean of its divisors is an integer number (19085794).
Almost surely, 2406552122 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 406552122, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (458059056).
406552122 is an abundant number, since it is smaller than the sum of its proper divisors (509565990).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
406552122 is a wasteful number, since it uses less digits than its factorization.
406552122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2425 (or 2413 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 27.
The square root of 406552122 is about 20163.1377022526. The cubic root of 406552122 is about 740.8075685796.
The spelling of 406552122 in words is "four hundred six million, five hundred fifty-two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •