Base | Representation |
---|---|
bin | 11000000000011100000101… |
… | …11101011001000011111101 |
3 | 20220220211110011122022122021 |
4 | 30000032002331121003331 |
5 | 23404414234340313103 |
6 | 304140051130320141 |
7 | 14056033025340223 |
oct | 1400160275310375 |
9 | 226824404568567 |
10 | 52791640166653 |
11 | 15903899665093 |
12 | 5b07459589051 |
13 | 235c2cbca395b |
14 | d071b4048b13 |
15 | 618372056bbd |
hex | 300382f590fd |
52791640166653 has 16 divisors (see below), whose sum is σ = 54735571013760. Its totient is φ = 50855970916800.
The previous prime is 52791640166627. The next prime is 52791640166659. The reversal of 52791640166653 is 35666104619725.
It is a cyclic number.
It is not a de Polignac number, because 52791640166653 - 233 = 52783050232061 is a prime.
It is a super-2 number, since 2×527916401666532 (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 = 52791640166591 and 52791640166600.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52791640166659) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 114356968 + ... + 114817678.
It is an arithmetic number, because the mean of its divisors is an integer number (3420973188360).
Almost surely, 252791640166653 is an apocalyptic number.
It is an amenable number.
52791640166653 is a deficient number, since it is larger than the sum of its proper divisors (1943930847107).
52791640166653 is a wasteful number, since it uses less digits than its factorization.
52791640166653 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 469668.
The product of its (nonzero) digits is 48988800, while the sum is 61.
The spelling of 52791640166653 in words is "fifty-two trillion, seven hundred ninety-one billion, six hundred forty million, one hundred sixty-six thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •