Base | Representation |
---|---|
bin | 1011110101011100110110… |
… | …01011011111100111110011 |
3 | 10102011001011110200120110221 |
4 | 11322232123023133213303 |
5 | 11402401324420444201 |
6 | 131204031530033511 |
7 | 5324205561504652 |
oct | 572563313374763 |
9 | 112131143616427 |
10 | 26025810328051 |
11 | 8324536490a16 |
12 | 2b03b87278897 |
13 | 116a2b9a07ba1 |
14 | 65d927c8b199 |
15 | 301ecec084a1 |
hex | 17ab9b2df9f3 |
26025810328051 has 8 divisors (see below), whose sum is σ = 26470254988800. Its totient is φ = 25581476641800.
The previous prime is 26025810328033. The next prime is 26025810328073. The reversal of 26025810328051 is 15082301852062.
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-26025810328051 is a prime.
It is a super-2 number, since 2×260258103280512 (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 = 26025810327989 and 26025810328007.
It is not an unprimeable number, because it can be changed into a prime (26025810308051) 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, 27270511 + ... + 28208728.
It is an arithmetic number, because the mean of its divisors is an integer number (3308781873600).
Almost surely, 226025810328051 is an apocalyptic number.
26025810328051 is a deficient number, since it is larger than the sum of its proper divisors (444444660749).
26025810328051 is an equidigital number, since it uses as much as digits as its factorization.
26025810328051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55487249.
The product of its (nonzero) digits is 230400, while the sum is 43.
The spelling of 26025810328051 in words is "twenty-six trillion, twenty-five billion, eight hundred ten million, three hundred twenty-eight thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •