Base | Representation |
---|---|
bin | 10111111111101… |
… | …000010100111101 |
3 | 1001001110222022200 |
4 | 113333220110331 |
5 | 1311023244341 |
6 | 103540102113 |
7 | 12655446204 |
oct | 2777502475 |
9 | 1031428280 |
10 | 402556221 |
11 | 1972614a1 |
12 | b2994939 |
13 | 65527c62 |
14 | 3b66c23b |
15 | 2551adb6 |
hex | 17fe853d |
402556221 has 12 divisors (see below), whose sum is σ = 601521180. Its totient is φ = 259116480.
The previous prime is 402556213. The next prime is 402556247. The reversal of 402556221 is 122655204.
It can be written as a sum of positive squares in 2 ways, for example, as 330730596 + 71825625 = 18186^2 + 8475^2 .
It is not a de Polignac number, because 402556221 - 23 = 402556213 is a prime.
It is a super-2 number, since 2×4025562212 = 324103022131601682, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (402556291) 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, 770920 + ... + 771441.
It is an arithmetic number, because the mean of its divisors is an integer number (50126765).
Almost surely, 2402556221 is an apocalyptic number.
It is an amenable number.
402556221 is a deficient number, since it is larger than the sum of its proper divisors (198964959).
402556221 is a wasteful number, since it uses less digits than its factorization.
402556221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1542396 (or 1542393 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 27.
The square root of 402556221 is about 20063.8037520307. The cubic root of 402556221 is about 738.3725012668.
The spelling of 402556221 in words is "four hundred two million, five hundred fifty-six thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •