Base | Representation |
---|---|
bin | 10111111110010000000011… |
… | …01000001101000010001101 |
3 | 20220122122101110012020010021 |
4 | 23333020001220031002031 |
5 | 23402201300203014334 |
6 | 304041334442542141 |
7 | 14050431630565264 |
oct | 1377100150150215 |
9 | 226578343166107 |
10 | 52716455907469 |
11 | 15884a180543a2 |
12 | 5ab4976507951 |
13 | 23551a9795023 |
14 | d036c0ac95db |
15 | 6164217443b4 |
hex | 2ff201a0d08d |
52716455907469 has 32 divisors (see below), whose sum is σ = 56546160168960. Its totient is φ = 48972701786112.
The previous prime is 52716455907463. The next prime is 52716455907481. The reversal of 52716455907469 is 96470955461725.
It is a cyclic number.
It is not a de Polignac number, because 52716455907469 - 215 = 52716455874701 is a prime.
It is a super-2 number, since 2×527164559074692 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 52716455907398 and 52716455907407.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52716455907463) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 283181029 + ... + 283367125.
It is an arithmetic number, because the mean of its divisors is an integer number (1767067505280).
Almost surely, 252716455907469 is an apocalyptic number.
It is an amenable number.
52716455907469 is a deficient number, since it is larger than the sum of its proper divisors (3829704261491).
52716455907469 is a wasteful number, since it uses less digits than its factorization.
52716455907469 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 186949.
The product of its (nonzero) digits is 571536000, while the sum is 70.
The spelling of 52716455907469 in words is "fifty-two trillion, seven hundred sixteen billion, four hundred fifty-five million, nine hundred seven thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •