Base | Representation |
---|---|
bin | 10111111011000… |
… | …101100000011101 |
3 | 1000222020110022011 |
4 | 113323011200131 |
5 | 1310222140041 |
6 | 103454351221 |
7 | 12642355261 |
oct | 2773054035 |
9 | 1028213264 |
10 | 401365021 |
11 | 196618532 |
12 | b24bb511 |
13 | 651cb9c5 |
14 | 3b43c0a1 |
15 | 25382e81 |
hex | 17ec581d |
401365021 has 2 divisors, whose sum is σ = 401365022. Its totient is φ = 401365020.
The previous prime is 401364983. The next prime is 401365043. The reversal of 401365021 is 120563104.
It is an a-pointer prime, because the next prime (401365043) can be obtained adding 401365021 to its sum of digits (22).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 388484100 + 12880921 = 19710^2 + 3589^2 .
It is a cyclic number.
It is not a de Polignac number, because 401365021 - 27 = 401364893 is a prime.
It is a super-2 number, since 2×4013650212 = 322187760164660882, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 401364983 and 401365001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (401365051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 200682510 + 200682511.
It is an arithmetic number, because the mean of its divisors is an integer number (200682511).
Almost surely, 2401365021 is an apocalyptic number.
It is an amenable number.
401365021 is a deficient number, since it is larger than the sum of its proper divisors (1).
401365021 is an equidigital number, since it uses as much as digits as its factorization.
401365021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 720, while the sum is 22.
The square root of 401365021 is about 20034.0964607841. The cubic root of 401365021 is about 737.6434782039.
The spelling of 401365021 in words is "four hundred one million, three hundred sixty-five thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •