Base | Representation |
---|---|
bin | 111101111000101101010… |
… | …010111000001000110001 |
3 | 120001120011101020112021012 |
4 | 331320231102320020301 |
5 | 1024134142022440124 |
6 | 13013410554040305 |
7 | 616152535462346 |
oct | 75705522701061 |
9 | 16046141215235 |
10 | 4252777546289 |
11 | 139a658067518 |
12 | 588272719095 |
13 | 24b05c45262c |
14 | 109b9a9ac7cd |
15 | 75957a75e0e |
hex | 3de2d4b8231 |
4252777546289 has 2 divisors, whose sum is σ = 4252777546290. Its totient is φ = 4252777546288.
The previous prime is 4252777546247. The next prime is 4252777546301. The reversal of 4252777546289 is 9826457772524.
4252777546289 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., 2883390783025 + 1369386763264 = 1698055^2 + 1170208^2 .
It is a cyclic number.
It is not a de Polignac number, because 4252777546289 - 212 = 4252777542193 is a prime.
It is a super-2 number, since 2×42527775462892 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (4252777546189) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2126388773144 + 2126388773145.
It is an arithmetic number, because the mean of its divisors is an integer number (2126388773145).
Almost surely, 24252777546289 is an apocalyptic number.
It is an amenable number.
4252777546289 is a deficient number, since it is larger than the sum of its proper divisors (1).
4252777546289 is an equidigital number, since it uses as much as digits as its factorization.
4252777546289 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 474163200, while the sum is 68.
The spelling of 4252777546289 in words is "four trillion, two hundred fifty-two billion, seven hundred seventy-seven million, five hundred forty-six thousand, two hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •