Base | Representation |
---|---|
bin | 11000010001011001… |
… | …001011001110110101 |
3 | 2111021021112021021000 |
4 | 120101121023032311 |
5 | 411333233203203 |
6 | 15550022513513 |
7 | 1611555036624 |
oct | 302131131665 |
9 | 74237467230 |
10 | 26061616053 |
11 | 10064114970 |
12 | 5073b95899 |
13 | 25c44680b5 |
14 | 13933736bb |
15 | a27ec54a3 |
hex | 61164b3b5 |
26061616053 has 16 divisors (see below), whose sum is σ = 42119784000. Its totient is φ = 15794918640.
The previous prime is 26061616051. The next prime is 26061616073. The reversal of 26061616053 is 35061616062.
26061616053 is a `hidden beast` number, since 26 + 0 + 616 + 16 + 0 + 5 + 3 = 666.
It is not a de Polignac number, because 26061616053 - 21 = 26061616051 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 26061615999 and 26061616017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26061616051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 43874478 + ... + 43875071.
It is an arithmetic number, because the mean of its divisors is an integer number (2632486500).
Almost surely, 226061616053 is an apocalyptic number.
It is an amenable number.
26061616053 is a deficient number, since it is larger than the sum of its proper divisors (16058167947).
26061616053 is a wasteful number, since it uses less digits than its factorization.
26061616053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87749569 (or 87749563 counting only the distinct ones).
The product of its (nonzero) digits is 38880, while the sum is 36.
Subtracting 26061616053 from its reverse (35061616062), we obtain a palindrome (9000000009).
The spelling of 26061616053 in words is "twenty-six billion, sixty-one million, six hundred sixteen thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •