Base | Representation |
---|---|
bin | 111010111110010000100… |
… | …000010111010011011001 |
3 | 112100102102011112110102001 |
4 | 322332100200113103121 |
5 | 1012344140103011124 |
6 | 12341421235041001 |
7 | 565534450265104 |
oct | 72762040272331 |
9 | 15312364473361 |
10 | 4052578563289 |
11 | 1322763a48463 |
12 | 555500440161 |
13 | 235205b44049 |
14 | 1002082d173b |
15 | 7063bde8b44 |
hex | 3af908174d9 |
4052578563289 has 2 divisors, whose sum is σ = 4052578563290. Its totient is φ = 4052578563288.
The previous prime is 4052578563263. The next prime is 4052578563349. The reversal of 4052578563289 is 9823658752504.
4052578563289 is digitally balanced in base 2, 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., 3580723598400 + 471854964889 = 1892280^2 + 686917^2 .
It is a cyclic number.
It is not a de Polignac number, because 4052578563289 - 239 = 3502822749401 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 4052578563289.
It is not a weakly prime, because it can be changed into another prime (4052578563239) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2026289281644 + 2026289281645.
It is an arithmetic number, because the mean of its divisors is an integer number (2026289281645).
Almost surely, 24052578563289 is an apocalyptic number.
It is an amenable number.
4052578563289 is a deficient number, since it is larger than the sum of its proper divisors (1).
4052578563289 is an equidigital number, since it uses as much as digits as its factorization.
4052578563289 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 145152000, while the sum is 64.
The spelling of 4052578563289 in words is "four trillion, fifty-two billion, five hundred seventy-eight million, five hundred sixty-three thousand, two hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •