Base | Representation |
---|---|
bin | 101001100101010110001… |
… | …1111111101100111000001 |
3 | 202020100221011011011102222 |
4 | 1103022230133331213001 |
5 | 1222114212321014044 |
6 | 20053305450420425 |
7 | 1126623666150563 |
oct | 123125437754701 |
9 | 22210834134388 |
10 | 5715200563649 |
11 | 19038917a5655 |
12 | 783789131715 |
13 | 325c307a0c65 |
14 | 15a88d79d333 |
15 | 9d9eb0098ee |
hex | 532ac7fd9c1 |
5715200563649 has 2 divisors, whose sum is σ = 5715200563650. Its totient is φ = 5715200563648.
The previous prime is 5715200563627. The next prime is 5715200563669. The reversal of 5715200563649 is 9463650025175.
5715200563649 is digitally balanced in base 3, 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., 3552727377424 + 2162473186225 = 1884868^2 + 1470535^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5715200563649 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5715200563649.
It is not a weakly prime, because it can be changed into another prime (5715200563609) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2857600281824 + 2857600281825.
It is an arithmetic number, because the mean of its divisors is an integer number (2857600281825).
Almost surely, 25715200563649 is an apocalyptic number.
It is an amenable number.
5715200563649 is a deficient number, since it is larger than the sum of its proper divisors (1).
5715200563649 is an equidigital number, since it uses as much as digits as its factorization.
5715200563649 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6804000, while the sum is 53.
The spelling of 5715200563649 in words is "five trillion, seven hundred fifteen billion, two hundred million, five hundred sixty-three thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •