Base | Representation |
---|---|
bin | 1011111110000010111000… |
… | …11101101010010100000011 |
3 | 10110012021101110202100200102 |
4 | 11333001130131222110003 |
5 | 11422221113340304001 |
6 | 131551430145313015 |
7 | 5354431443625262 |
oct | 577013435522403 |
9 | 113167343670612 |
10 | 26321110869251 |
11 | 84287a1994270 |
12 | 2b5125a93576b |
13 | 118c0bb035133 |
14 | 66dd3cc025d9 |
15 | 309a14a29e6b |
hex | 17f05c76a503 |
26321110869251 has 4 divisors (see below), whose sum is σ = 28713939130104. Its totient is φ = 23928282608400.
The previous prime is 26321110869241. The next prime is 26321110869253. The reversal of 26321110869251 is 15296801112362.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 26321110869251 - 230 = 26320037127427 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 26321110869196 and 26321110869205.
It is not an unprimeable number, because it can be changed into a prime (26321110869253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1196414130410 + ... + 1196414130431.
It is an arithmetic number, because the mean of its divisors is an integer number (7178484782526).
Almost surely, 226321110869251 is an apocalyptic number.
26321110869251 is a deficient number, since it is larger than the sum of its proper divisors (2392828260853).
26321110869251 is a wasteful number, since it uses less digits than its factorization.
26321110869251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2392828260852.
The product of its (nonzero) digits is 311040, while the sum is 47.
The spelling of 26321110869251 in words is "twenty-six trillion, three hundred twenty-one billion, one hundred ten million, eight hundred sixty-nine thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •