Base | Representation |
---|---|
bin | 11001100111010… |
… | …11101000010001 |
3 | 112222022202121001 |
4 | 30303223220101 |
5 | 420001442031 |
6 | 33153302001 |
7 | 5216255452 |
oct | 1463535021 |
9 | 488282531 |
10 | 214874641 |
11 | 100322553 |
12 | 5bb64901 |
13 | 35694877 |
14 | 20775129 |
15 | 13ce6861 |
hex | cceba11 |
214874641 has 2 divisors, whose sum is σ = 214874642. Its totient is φ = 214874640.
The previous prime is 214874603. The next prime is 214874657. The reversal of 214874641 is 146478412.
It is a happy number.
214874641 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., 201214225 + 13660416 = 14185^2 + 3696^2 .
It is a cyclic number.
It is not a de Polignac number, because 214874641 - 29 = 214874129 is a prime.
It is a super-2 number, since 2×2148746412 = 92342222689757762, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 214874641.
It is not a weakly prime, because it can be changed into another prime (214874141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 107437320 + 107437321.
It is an arithmetic number, because the mean of its divisors is an integer number (107437321).
Almost surely, 2214874641 is an apocalyptic number.
It is an amenable number.
214874641 is a deficient number, since it is larger than the sum of its proper divisors (1).
214874641 is an equidigital number, since it uses as much as digits as its factorization.
214874641 is an evil number, because the sum of its binary digits is even.
The product of its digits is 43008, while the sum is 37.
The square root of 214874641 is about 14658.6029689053. The cubic root of 214874641 is about 598.9561860664.
The spelling of 214874641 in words is "two hundred fourteen million, eight hundred seventy-four thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •