Base | Representation |
---|---|
bin | 10111111011100… |
… | …111011100000001 |
3 | 1000222111111221120 |
4 | 113323213130001 |
5 | 1310241112001 |
6 | 103501342453 |
7 | 12643504413 |
oct | 2773473401 |
9 | 1028444846 |
10 | 401504001 |
11 | 196702998 |
12 | b2567a29 |
13 | 6524a042 |
14 | 3b4769b3 |
15 | 253ae236 |
hex | 17ee7701 |
401504001 has 4 divisors (see below), whose sum is σ = 535338672. Its totient is φ = 267669332.
The previous prime is 401503997. The next prime is 401504003. The reversal of 401504001 is 100405104.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 401504001 - 22 = 401503997 is a prime.
It is a super-2 number, since 2×4015040012 = 322410925638016002, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (401504003) 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 3 ways as a sum of consecutive naturals, for example, 66917331 + ... + 66917336.
It is an arithmetic number, because the mean of its divisors is an integer number (133834668).
Almost surely, 2401504001 is an apocalyptic number.
It is an amenable number.
401504001 is a deficient number, since it is larger than the sum of its proper divisors (133834671).
401504001 is a wasteful number, since it uses less digits than its factorization.
401504001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133834670.
The product of its (nonzero) digits is 80, while the sum is 15.
The square root of 401504001 is about 20037.5647472441. The cubic root of 401504001 is about 737.7286092398.
Adding to 401504001 its reverse (100405104), we get a palindrome (501909105).
The spelling of 401504001 in words is "four hundred one million, five hundred four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •