Base | Representation |
---|---|
bin | 11001100001011… |
… | …10100010101101 |
3 | 112220212102011212 |
4 | 30300232202231 |
5 | 414302201031 |
6 | 33124524205 |
7 | 5206551443 |
oct | 1460564255 |
9 | 486772155 |
10 | 214100141 |
11 | aa943672 |
12 | 5b850665 |
13 | 35483198 |
14 | 20612b93 |
15 | 13be212b |
hex | cc2e8ad |
214100141 has 2 divisors, whose sum is σ = 214100142. Its totient is φ = 214100140.
The previous prime is 214100101. The next prime is 214100149. The reversal of 214100141 is 141001412.
214100141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 148328041 + 65772100 = 12179^2 + 8110^2 .
It is a cyclic number.
It is not a de Polignac number, because 214100141 - 214 = 214083757 is a prime.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (214100149) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 107050070 + 107050071.
It is an arithmetic number, because the mean of its divisors is an integer number (107050071).
Almost surely, 2214100141 is an apocalyptic number.
It is an amenable number.
214100141 is a deficient number, since it is larger than the sum of its proper divisors (1).
214100141 is an equidigital number, since it uses as much as digits as its factorization.
214100141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 14.
The square root of 214100141 is about 14632.1611869197. The cubic root of 214100141 is about 598.2356883890.
Adding to 214100141 its reverse (141001412), we get a palindrome (355101553).
It can be divided in two parts, 2 and 14100141, that multiplied together give a palindrome (28200282).
The spelling of 214100141 in words is "two hundred fourteen million, one hundred thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •