Base | Representation |
---|---|
bin | 10111110110010… |
… | …011011000111001 |
3 | 1000212212202022220 |
4 | 113312103120321 |
5 | 1304412024121 |
6 | 103411434253 |
7 | 12625613562 |
oct | 2766233071 |
9 | 1025782286 |
10 | 400111161 |
11 | 19594148a |
12 | b1bb5989 |
13 | 64b80088 |
14 | 3b1d3169 |
15 | 251d66c6 |
hex | 17d93639 |
400111161 has 4 divisors (see below), whose sum is σ = 533481552. Its totient is φ = 266740772.
The previous prime is 400111147. The next prime is 400111163. The reversal of 400111161 is 161111004.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 400111161 - 211 = 400109113 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 400111161.
It is not an unprimeable number, because it can be changed into a prime (400111163) 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, 66685191 + ... + 66685196.
It is an arithmetic number, because the mean of its divisors is an integer number (133370388).
Almost surely, 2400111161 is an apocalyptic number.
It is an amenable number.
400111161 is a deficient number, since it is larger than the sum of its proper divisors (133370391).
400111161 is a wasteful number, since it uses less digits than its factorization.
400111161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133370390.
The product of its (nonzero) digits is 24, while the sum is 15.
The square root of 400111161 is about 20002.7788319523. The cubic root of 400111161 is about 736.8745468440.
Adding to 400111161 its reverse (161111004), we get a palindrome (561222165).
The spelling of 400111161 in words is "four hundred million, one hundred eleven thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •