Base | Representation |
---|---|
bin | 10111111010111… |
… | …101001110110001 |
3 | 1000222011201210121 |
4 | 113322331032301 |
5 | 1310220043441 |
6 | 103453530241 |
7 | 12642154402 |
oct | 2772751661 |
9 | 1028151717 |
10 | 401331121 |
11 | 1965a5014 |
12 | b24a3981 |
13 | 651b9449 |
14 | 3b42d9a9 |
15 | 25377dd1 |
hex | 17ebd3b1 |
401331121 has 12 divisors (see below), whose sum is σ = 432354240. Its totient is φ = 372384320.
The previous prime is 401331113. The next prime is 401331127. The reversal of 401331121 is 121133104.
It is not a de Polignac number, because 401331121 - 23 = 401331113 is a prime.
It is a super-2 number, since 2×4013311212 = 322133337366233282, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 401331095 and 401331104.
It is not an unprimeable number, because it can be changed into a prime (401331127) 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, 10740 + ... + 30298.
It is an arithmetic number, because the mean of its divisors is an integer number (36029520).
Almost surely, 2401331121 is an apocalyptic number.
It is an amenable number.
401331121 is a deficient number, since it is larger than the sum of its proper divisors (31023119).
401331121 is a wasteful number, since it uses less digits than its factorization.
401331121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19664 (or 19647 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 401331121 is about 20033.2503852969. The cubic root of 401331121 is about 737.6227100613.
Adding to 401331121 its reverse (121133104), we get a palindrome (522464225).
The spelling of 401331121 in words is "four hundred one million, three hundred thirty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •