Base | Representation |
---|---|
bin | 11000111101001101… |
… | …001010001010100101 |
3 | 2120011111122112202002 |
4 | 120331031022022211 |
5 | 414334421212321 |
6 | 20151001255045 |
7 | 1636021611161 |
oct | 307515121245 |
9 | 76144575662 |
10 | 26796663461 |
11 | 10401021967 |
12 | 523a194485 |
13 | 26b08289a9 |
14 | 1422c31ca1 |
15 | a6c7bc20b |
hex | 63d34a2a5 |
26796663461 has 8 divisors (see below), whose sum is σ = 27225059904. Its totient is φ = 26370780160.
The previous prime is 26796663431. The next prime is 26796663463. The reversal of 26796663461 is 16436669762.
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 26796663461 - 222 = 26792469157 is a prime.
It is a super-2 number, since 2×267966634612 (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 = 26796663397 and 26796663406.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26796663463) 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 7 ways as a sum of consecutive naturals, for example, 606785 + ... + 649446.
It is an arithmetic number, because the mean of its divisors is an integer number (3403132488).
Almost surely, 226796663461 is an apocalyptic number.
It is an amenable number.
26796663461 is a deficient number, since it is larger than the sum of its proper divisors (428396443).
26796663461 is a wasteful number, since it uses less digits than its factorization.
26796663461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1256571.
The product of its digits is 11757312, while the sum is 56.
The spelling of 26796663461 in words is "twenty-six billion, seven hundred ninety-six million, six hundred sixty-three thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •