Base | Representation |
---|---|
bin | 10111111010111… |
… | …111011011101111 |
3 | 1000222012012011202 |
4 | 113322333123233 |
5 | 1310220341033 |
6 | 103454040115 |
7 | 12642222611 |
oct | 2772773357 |
9 | 1028165152 |
10 | 401340143 |
11 | 196600876 |
12 | b24a903b |
13 | 651c0599 |
14 | 3b432db1 |
15 | 2537a8e8 |
hex | 17ebf6ef |
401340143 has 2 divisors, whose sum is σ = 401340144. Its totient is φ = 401340142.
The previous prime is 401340091. The next prime is 401340151. The reversal of 401340143 is 341043104.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 401340143 - 214 = 401323759 is a prime.
It is a super-2 number, since 2×4013401432 = 322147820766520898, which contains 22 as substring.
It is a Sophie Germain prime.
It is equal to p21403721 and since 401340143 and 21403721 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (401342143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 200670071 + 200670072.
It is an arithmetic number, because the mean of its divisors is an integer number (200670072).
Almost surely, 2401340143 is an apocalyptic number.
401340143 is a deficient number, since it is larger than the sum of its proper divisors (1).
401340143 is an equidigital number, since it uses as much as digits as its factorization.
401340143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 20.
The square root of 401340143 is about 20033.4755596726. The cubic root of 401340143 is about 737.6282373195.
Adding to 401340143 its reverse (341043104), we get a palindrome (742383247).
The spelling of 401340143 in words is "four hundred one million, three hundred forty thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •