Base | Representation |
---|---|
bin | 11000010101010… |
… | …11000100111101 |
3 | 112020002121010211 |
4 | 30022223010331 |
5 | 404223440402 |
6 | 32131032421 |
7 | 5026013044 |
oct | 1412530475 |
9 | 466077124 |
10 | 204124477 |
11 | a524a817 |
12 | 5843b711 |
13 | 3339c71b |
14 | 1d17755b |
15 | 12dc14d7 |
hex | c2ab13d |
204124477 has 2 divisors, whose sum is σ = 204124478. Its totient is φ = 204124476.
The previous prime is 204124451. The next prime is 204124493. The reversal of 204124477 is 774421402.
204124477 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., 116402521 + 87721956 = 10789^2 + 9366^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-204124477 is a prime.
It is a super-2 number, since 2×2041244772 = 83333604221047058, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (204124447) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 102062238 + 102062239.
It is an arithmetic number, because the mean of its divisors is an integer number (102062239).
Almost surely, 2204124477 is an apocalyptic number.
It is an amenable number.
204124477 is a deficient number, since it is larger than the sum of its proper divisors (1).
204124477 is an equidigital number, since it uses as much as digits as its factorization.
204124477 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12544, while the sum is 31.
The square root of 204124477 is about 14287.2137591624. The cubic root of 204124477 is about 588.7962404950.
Adding to 204124477 its reverse (774421402), we get a palindrome (978545879).
The spelling of 204124477 in words is "two hundred four million, one hundred twenty-four thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •