Base | Representation |
---|---|
bin | 10111111101100… |
… | …011011101100101 |
3 | 1001000110022210112 |
4 | 113331203131211 |
5 | 1310403341010 |
6 | 103520302405 |
7 | 12651021443 |
oct | 2775433545 |
9 | 1030408715 |
10 | 402012005 |
11 | 196a1a62a |
12 | b2771a05 |
13 | 65397335 |
14 | 3b569b93 |
15 | 2545ea05 |
hex | 17f63765 |
402012005 has 12 divisors (see below), whose sum is σ = 512462820. Its totient is φ = 302690304.
The previous prime is 402012001. The next prime is 402012029. The reversal of 402012005 is 500210204.
It can be written as a sum of positive squares in 6 ways, for example, as 1331716 + 400680289 = 1154^2 + 20017^2 .
It is not a de Polignac number, because 402012005 - 22 = 402012001 is a prime.
It is a super-2 number, since 2×4020120052 = 323227304328240050, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (402012001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 137660 + ... + 140549.
It is an arithmetic number, because the mean of its divisors is an integer number (42705235).
Almost surely, 2402012005 is an apocalyptic number.
It is an amenable number.
402012005 is a deficient number, since it is larger than the sum of its proper divisors (110450815).
402012005 is a wasteful number, since it uses less digits than its factorization.
402012005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 278248 (or 278231 counting only the distinct ones).
The product of its (nonzero) digits is 80, while the sum is 14.
The square root of 402012005 is about 20050.2370310179. The cubic root of 402012005 is about 738.0396158012.
Adding to 402012005 its reverse (500210204), we get a palindrome (902222209).
The spelling of 402012005 in words is "four hundred two million, twelve thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •