Base | Representation |
---|---|
bin | 10111110110011… |
… | …011000001000001 |
3 | 1000212221100011221 |
4 | 113312123001001 |
5 | 1304414024101 |
6 | 103412235041 |
7 | 12626103631 |
oct | 2766330101 |
9 | 1025840157 |
10 | 400142401 |
11 | 1959629aa |
12 | b200ba81 |
13 | 64b91369 |
14 | 3b2006c1 |
15 | 251e0aa1 |
hex | 17d9b041 |
400142401 has 2 divisors, whose sum is σ = 400142402. Its totient is φ = 400142400.
The previous prime is 400142399. The next prime is 400142417. The reversal of 400142401 is 104241004.
It is an a-pointer prime, because the next prime (400142417) can be obtained adding 400142401 to its sum of digits (16).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 400040001 + 102400 = 20001^2 + 320^2 .
It is a cyclic number.
It is not a de Polignac number, because 400142401 - 21 = 400142399 is a prime.
It is a super-2 number, since 2×4001424012 = 320227882156089602, which contains 22 as substring.
Together with 400142399, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (400140401) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 200071200 + 200071201.
It is an arithmetic number, because the mean of its divisors is an integer number (200071201).
Almost surely, 2400142401 is an apocalyptic number.
It is an amenable number.
400142401 is a deficient number, since it is larger than the sum of its proper divisors (1).
400142401 is an equidigital number, since it uses as much as digits as its factorization.
400142401 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 128, while the sum is 16.
The square root of 400142401 is about 20003.5597082119. The cubic root of 400142401 is about 736.8937243160.
Adding to 400142401 its reverse (104241004), we get a palindrome (504383405).
The spelling of 400142401 in words is "four hundred million, one hundred forty-two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •