Search a number
-
+
4227047057 is a prime number
BaseRepresentation
bin1111101111110011…
…1001111010010001
3101220120221020110102
43323330321322101
532124111001212
61535240142145
7206515210232
oct37374717221
911816836412
104227047057
11187a070022
1299b767955
1352498889c
142c1577089
1519b1735c2
hexfbf39e91

4227047057 has 2 divisors, whose sum is σ = 4227047058. Its totient is φ = 4227047056.

The previous prime is 4227047023. The next prime is 4227047101. The reversal of 4227047057 is 7507407224.

4227047057 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 2219917456 + 2007129601 = 47116^2 + 44801^2 .

It is a cyclic number.

It is not a de Polignac number, because 4227047057 - 214 = 4227030673 is a prime.

It is a super-2 number, since 2×42270470572 = 35735853644184722498, 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 4227047057.

It is not a weakly prime, because it can be changed into another prime (4227040057) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2113523528 + 2113523529.

It is an arithmetic number, because the mean of its divisors is an integer number (2113523529).

Almost surely, 24227047057 is an apocalyptic number.

It is an amenable number.

4227047057 is a deficient number, since it is larger than the sum of its proper divisors (1).

4227047057 is an equidigital number, since it uses as much as digits as its factorization.

4227047057 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 109760, while the sum is 38.

The square root of 4227047057 is about 65015.7446854222. The cubic root of 4227047057 is about 1616.8846108036.

The spelling of 4227047057 in words is "four billion, two hundred twenty-seven million, forty-seven thousand, fifty-seven".