Base | Representation |
---|---|
bin | 1010101110000011… |
… | …01001010100000101 |
3 | 112212002002010102112 |
4 | 11113001221110011 |
5 | 43241241011303 |
6 | 2351021550405 |
7 | 262420555424 |
oct | 52701512405 |
9 | 15762063375 |
10 | 5755016453 |
11 | 249361404a |
12 | 1147415405 |
13 | 7093c17a4 |
14 | 3c847b2bb |
15 | 23a3950d8 |
hex | 157069505 |
5755016453 has 2 divisors, whose sum is σ = 5755016454. Its totient is φ = 5755016452.
The previous prime is 5755016417. The next prime is 5755016459. The reversal of 5755016453 is 3546105575.
5755016453 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., 4274152129 + 1480864324 = 65377^2 + 38482^2 .
It is a cyclic number.
It is not a de Polignac number, because 5755016453 - 218 = 5754754309 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5755016453.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5755016459) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2877508226 + 2877508227.
It is an arithmetic number, because the mean of its divisors is an integer number (2877508227).
Almost surely, 25755016453 is an apocalyptic number.
It is an amenable number.
5755016453 is a deficient number, since it is larger than the sum of its proper divisors (1).
5755016453 is an equidigital number, since it uses as much as digits as its factorization.
5755016453 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 315000, while the sum is 41.
The square root of 5755016453 is about 75861.8247407746. The cubic root of 5755016453 is about 1792.0447751230.
The spelling of 5755016453 in words is "five billion, seven hundred fifty-five million, sixteen thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •