Base | Representation |
---|---|
bin | 11000011101101101… |
… | …100001011000011101 |
3 | 2111210200101200202111 |
4 | 120131231201120131 |
5 | 412244134320003 |
6 | 20022324154021 |
7 | 1616644443532 |
oct | 303555413035 |
9 | 74720350674 |
10 | 26268276253 |
11 | 1015a83681a |
12 | 5111238911 |
13 | 2628214a3b |
14 | 13b29aad89 |
15 | a3b1e7e6d |
hex | 61db6161d |
26268276253 has 4 divisors (see below), whose sum is σ = 26268601788. Its totient is φ = 26267950720.
The previous prime is 26268276233. The next prime is 26268276259. The reversal of 26268276253 is 35267286262.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 13680109444 + 12588166809 = 116962^2 + 112197^2 .
It is a cyclic number.
It is not a de Polignac number, because 26268276253 - 229 = 25731405341 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 26268276197 and 26268276206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26268276259) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 58893 + ... + 236653.
It is an arithmetic number, because the mean of its divisors is an integer number (6567150447).
Almost surely, 226268276253 is an apocalyptic number.
It is an amenable number.
26268276253 is a deficient number, since it is larger than the sum of its proper divisors (325535).
26268276253 is a wasteful number, since it uses less digits than its factorization.
26268276253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 325534.
The product of its digits is 2903040, while the sum is 49.
The spelling of 26268276253 in words is "twenty-six billion, two hundred sixty-eight million, two hundred seventy-six thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •