Base | Representation |
---|---|
bin | 110001000110001010… |
… | …011001111111001001 |
3 | 12001001220211220001100 |
4 | 301012022121333021 |
5 | 1330430441144203 |
6 | 40115010412013 |
7 | 3544240621101 |
oct | 610612317711 |
9 | 161056756040 |
10 | 52716740553 |
11 | 203a2253484 |
12 | a272891009 |
13 | 4c81868109 |
14 | 27a1480201 |
15 | 1588134ea3 |
hex | c46299fc9 |
52716740553 has 6 divisors (see below), whose sum is σ = 76146403034. Its totient is φ = 35144493696.
The previous prime is 52716740533. The next prime is 52716740591. The reversal of 52716740553 is 35504761725.
It is a happy number.
52716740553 is a `hidden beast` number, since 5 + 27 + 1 + 6 + 74 + 0 + 553 = 666.
52716740553 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 51759890064 + 956850489 = 227508^2 + 30933^2 .
It is not a de Polignac number, because 52716740553 - 213 = 52716732361 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 52716740499 and 52716740508.
It is not an unprimeable number, because it can be changed into a prime (52716740533) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2928707800 + ... + 2928707817.
Almost surely, 252716740553 is an apocalyptic number.
It is an amenable number.
52716740553 is a deficient number, since it is larger than the sum of its proper divisors (23429662481).
52716740553 is a wasteful number, since it uses less digits than its factorization.
52716740553 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5857415623 (or 5857415620 counting only the distinct ones).
The product of its (nonzero) digits is 882000, while the sum is 45.
The spelling of 52716740553 in words is "fifty-two billion, seven hundred sixteen million, seven hundred forty thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •