Base | Representation |
---|---|
bin | 10111111011010… |
… | …000000000000001 |
3 | 1000222022122021000 |
4 | 113323100000001 |
5 | 1310230024001 |
6 | 103455322213 |
7 | 12642624501 |
oct | 2773200001 |
9 | 1028278230 |
10 | 401408001 |
11 | 196647855 |
12 | b2520369 |
13 | 65215437 |
14 | 3b44da01 |
15 | 25390a86 |
hex | 17ed0001 |
401408001 has 8 divisors (see below), whose sum is σ = 594678560. Its totient is φ = 267605316.
The previous prime is 401407957. The next prime is 401408009. The reversal of 401408001 is 100804104.
It is not a de Polignac number, because 401408001 - 213 = 401399809 is a prime.
It is a super-2 number, since 2×4014080012 = 322256766533632002, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (401408009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7433455 + ... + 7433508.
It is an arithmetic number, because the mean of its divisors is an integer number (74334820).
It is a Proth number, since it is equal to 6125 ⋅ 216 + 1 and 6125 < 216.
Almost surely, 2401408001 is an apocalyptic number.
It is an amenable number.
401408001 is a deficient number, since it is larger than the sum of its proper divisors (193270559).
401408001 is a wasteful number, since it uses less digits than its factorization.
401408001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14866972 (or 14866966 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
The square root of 401408001 is about 20035.1691033542. The cubic root of 401408001 is about 737.6698073419.
It can be divided in two parts, 40 and 1408001, that added together give a palindrome (1408041).
The spelling of 401408001 in words is "four hundred one million, four hundred eight thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •