Base | Representation |
---|---|
bin | 110001000011011111… |
… | …010000110111001001 |
3 | 12000221210102120012201 |
4 | 301003133100313021 |
5 | 1330333000022203 |
6 | 40110325040201 |
7 | 3543154364212 |
oct | 610337206711 |
9 | 160853376181 |
10 | 52671876553 |
11 | 203799a049a |
12 | a25b856061 |
13 | 4c7548a67a |
14 | 2799522409 |
15 | 1584221e1d |
hex | c437d0dc9 |
52671876553 has 8 divisors (see below), whose sum is σ = 52785838368. Its totient is φ = 52557988224.
The previous prime is 52671876541. The next prime is 52671876557. The reversal of 52671876553 is 35567817625.
52671876553 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 52671876553 - 233 = 44081941961 is a prime.
It is a super-2 number, since 2×526718765532 (a number of 22 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 = 52671876494 and 52671876503.
It is not an unprimeable number, because it can be changed into a prime (52671876557) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1561401 + ... + 1594777.
It is an arithmetic number, because the mean of its divisors is an integer number (6598229796).
Almost surely, 252671876553 is an apocalyptic number.
It is an amenable number.
52671876553 is a deficient number, since it is larger than the sum of its proper divisors (113961815).
52671876553 is a wasteful number, since it uses less digits than its factorization.
52671876553 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36743.
The product of its digits is 10584000, while the sum is 55.
The spelling of 52671876553 in words is "fifty-two billion, six hundred seventy-one million, eight hundred seventy-six thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •