Base | Representation |
---|---|
bin | 10111111010010… |
… | …100101000000001 |
3 | 1000221212021122121 |
4 | 113322110220001 |
5 | 1310144233201 |
6 | 103450204241 |
7 | 12640562452 |
oct | 2772245001 |
9 | 1027767577 |
10 | 401164801 |
11 | 1964a1064 |
12 | b2423681 |
13 | 6515b82b |
14 | 3b3c9129 |
15 | 253439a1 |
hex | 17e94a01 |
401164801 has 4 divisors (see below), whose sum is σ = 414998100. Its totient is φ = 387331504.
The previous prime is 401164739. The next prime is 401164849. The reversal of 401164801 is 108461104.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 324864576 + 76300225 = 18024^2 + 8735^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-401164801 is a prime.
It is a super-2 number, since 2×4011648012 = 321866395122739202, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (401164201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6916606 + ... + 6916663.
It is an arithmetic number, because the mean of its divisors is an integer number (103749525).
Almost surely, 2401164801 is an apocalyptic number.
It is an amenable number.
401164801 is a deficient number, since it is larger than the sum of its proper divisors (13833299).
401164801 is a wasteful number, since it uses less digits than its factorization.
401164801 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13833298.
The product of its (nonzero) digits is 768, while the sum is 25.
The square root of 401164801 is about 20029.0988564139. The cubic root of 401164801 is about 737.5208005624.
The spelling of 401164801 in words is "four hundred one million, one hundred sixty-four thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •