Base | Representation |
---|---|
bin | 10111111010001… |
… | …010111100010101 |
3 | 1000221210021020201 |
4 | 113322022330111 |
5 | 1310142001031 |
6 | 103445300501 |
7 | 12640336024 |
oct | 2772127425 |
9 | 1027707221 |
10 | 401125141 |
11 | 19647428a |
12 | b2404731 |
13 | 65146771 |
14 | 3b3b88bb |
15 | 25336d61 |
hex | 17e8af15 |
401125141 has 4 divisors (see below), whose sum is σ = 403341484. Its totient is φ = 398908800.
The previous prime is 401125133. The next prime is 401125159. The reversal of 401125141 is 141521104.
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 16573041 + 384552100 = 4071^2 + 19610^2 .
It is a cyclic number.
It is not a de Polignac number, because 401125141 - 23 = 401125133 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (401125121) 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, 1107900 + ... + 1108261.
It is an arithmetic number, because the mean of its divisors is an integer number (100835371).
Almost surely, 2401125141 is an apocalyptic number.
It is an amenable number.
401125141 is a deficient number, since it is larger than the sum of its proper divisors (2216343).
401125141 is a wasteful number, since it uses less digits than its factorization.
401125141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2216342.
The product of its (nonzero) digits is 160, while the sum is 19.
The square root of 401125141 is about 20028.1087724228. The cubic root of 401125141 is about 737.4964954731.
Adding to 401125141 its reverse (141521104), we get a palindrome (542646245).
The spelling of 401125141 in words is "four hundred one million, one hundred twenty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •