Base | Representation |
---|---|
bin | 10111111101101… |
… | …101011110000000 |
3 | 1001000112102000120 |
4 | 113331231132000 |
5 | 1310411143432 |
6 | 103521220240 |
7 | 12651252105 |
oct | 2775553600 |
9 | 1030472016 |
10 | 402052992 |
11 | 196a48400 |
12 | b2791680 |
13 | 653acba3 |
14 | 3b57aaac |
15 | 2546bc2c |
hex | 17f6d780 |
402052992 has 192 divisors, whose sum is σ = 1245358800. Its totient is φ = 114442240.
The previous prime is 402052991. The next prime is 402052999. The reversal of 402052992 is 299250204.
It is a tau number, because it is divible by the number of its divisors (192).
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (402052991) by changing a digit.
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, 789634 + ... + 790142.
Almost surely, 2402052992 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 402052992, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (622679400).
402052992 is an abundant number, since it is smaller than the sum of its proper divisors (843305808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
402052992 is a wasteful number, since it uses less digits than its factorization.
402052992 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 565 (or 542 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 33.
The square root of 402052992 is about 20051.2591125844. The cubic root of 402052992 is about 738.0646971432.
The spelling of 402052992 in words is "four hundred two million, fifty-two thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.145 sec. • engine limits •