Base | Representation |
---|---|
bin | 11001001000101110… |
… | …000010111101001001 |
3 | 2120122222010121222121 |
4 | 121020232002331021 |
5 | 420233344142212 |
6 | 20222101451241 |
7 | 1643555542564 |
oct | 311056027511 |
9 | 76588117877 |
10 | 26989834057 |
11 | 104a006a88a |
12 | 5292a10b21 |
13 | 2711861614 |
14 | 14407574db |
15 | a7e727d07 |
hex | 648b82f49 |
26989834057 has 8 divisors (see below), whose sum is σ = 28167605640. Its totient is φ = 25828535040.
The previous prime is 26989834033. The next prime is 26989834099. The reversal of 26989834057 is 75043898962.
It can be written as a sum of positive squares in 4 ways, for example, as 2597329296 + 24392504761 = 50964^2 + 156181^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-26989834057 is a prime.
It is a super-2 number, since 2×269898340572 (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 = 26989833986 and 26989834004.
It is not an unprimeable number, because it can be changed into a prime (26989834657) 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, 4114794 + ... + 4121347.
It is an arithmetic number, because the mean of its divisors is an integer number (3520950705).
Almost surely, 226989834057 is an apocalyptic number.
It is an amenable number.
26989834057 is a deficient number, since it is larger than the sum of its proper divisors (1177771583).
26989834057 is a wasteful number, since it uses less digits than its factorization.
26989834057 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8236283.
The product of its (nonzero) digits is 26127360, while the sum is 61.
The spelling of 26989834057 in words is "twenty-six billion, nine hundred eighty-nine million, eight hundred thirty-four thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •