Base | Representation |
---|---|
bin | 10111111010101… |
… | …001111100101101 |
3 | 1000222000201110102 |
4 | 113322221330231 |
5 | 1310210032031 |
6 | 103452120445 |
7 | 12641405213 |
oct | 2772517455 |
9 | 1028021412 |
10 | 401252141 |
11 | 196550744 |
12 | b2466125 |
13 | 6518c504 |
14 | 3b40ccb3 |
15 | 2535e7cb |
hex | 17ea9f2d |
401252141 has 2 divisors, whose sum is σ = 401252142. Its totient is φ = 401252140.
The previous prime is 401252119. The next prime is 401252143. The reversal of 401252141 is 141252104.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 362750116 + 38502025 = 19046^2 + 6205^2 .
It is a cyclic number.
It is not a de Polignac number, because 401252141 - 26 = 401252077 is a prime.
It is a super-2 number, since 2×4012521412 = 322006561314167762, which contains 22 as substring.
Together with 401252143, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (401252143) 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 as a sum of consecutive naturals, namely, 200626070 + 200626071.
It is an arithmetic number, because the mean of its divisors is an integer number (200626071).
Almost surely, 2401252141 is an apocalyptic number.
It is an amenable number.
401252141 is a deficient number, since it is larger than the sum of its proper divisors (1).
401252141 is an equidigital number, since it uses as much as digits as its factorization.
401252141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 320, while the sum is 20.
The square root of 401252141 is about 20031.2790655015. The cubic root of 401252141 is about 737.5743200407.
The spelling of 401252141 in words is "four hundred one million, two hundred fifty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •