Base | Representation |
---|---|
bin | 11001100101101… |
… | …11100101100101 |
3 | 112221220221012002 |
4 | 30302313211211 |
5 | 414423131402 |
6 | 33144535045 |
7 | 5214410132 |
oct | 1462674545 |
9 | 487827162 |
10 | 214661477 |
11 | 100197388 |
12 | 5ba81485 |
13 | 3561b834 |
14 | 2071b589 |
15 | 13ca3602 |
hex | ccb7965 |
214661477 has 2 divisors, whose sum is σ = 214661478. Its totient is φ = 214661476.
The previous prime is 214661437. The next prime is 214661479. The reversal of 214661477 is 774166412.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 186295201 + 28366276 = 13649^2 + 5326^2 .
It is a cyclic number.
It is not a de Polignac number, because 214661477 - 26 = 214661413 is a prime.
Together with 214661479, it forms a pair of twin primes.
It is a Chen prime.
It is equal to p11844488 and since 214661477 and 11844488 have the same sum of digits, it is a Honaker prime.
It is a self number, because there is not a number n which added to its sum of digits gives 214661477.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (214661479) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 107330738 + 107330739.
It is an arithmetic number, because the mean of its divisors is an integer number (107330739).
Almost surely, 2214661477 is an apocalyptic number.
It is an amenable number.
214661477 is a deficient number, since it is larger than the sum of its proper divisors (1).
214661477 is an equidigital number, since it uses as much as digits as its factorization.
214661477 is an evil number, because the sum of its binary digits is even.
The product of its digits is 56448, while the sum is 38.
The square root of 214661477 is about 14651.3302126462. The cubic root of 214661477 is about 598.7580579254.
The spelling of 214661477 in words is "two hundred fourteen million, six hundred sixty-one thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •