Base | Representation |
---|---|
bin | 11000010111000111… |
… | …100010011011001001 |
3 | 2111111222020120221221 |
4 | 120113013202123021 |
5 | 412032324441003 |
6 | 20003333202041 |
7 | 1614132256015 |
oct | 302707423311 |
9 | 74458216857 |
10 | 26157655753 |
11 | 10103350a19 |
12 | 50a0190321 |
13 | 260b323118 |
14 | 13a2013545 |
15 | a316467bd |
hex | 6171e26c9 |
26157655753 has 4 divisors (see below), whose sum is σ = 26864619460. Its totient is φ = 25450692048.
The previous prime is 26157655751. The next prime is 26157655787. The reversal of 26157655753 is 35755675162.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 22203384064 + 3954271689 = 149008^2 + 62883^2 .
It is a cyclic number.
It is not a de Polignac number, because 26157655753 - 21 = 26157655751 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 26157655753.
It is not an unprimeable number, because it can be changed into a prime (26157655751) 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 3 ways as a sum of consecutive naturals, for example, 353481798 + ... + 353481871.
It is an arithmetic number, because the mean of its divisors is an integer number (6716154865).
Almost surely, 226157655753 is an apocalyptic number.
It is an amenable number.
26157655753 is a deficient number, since it is larger than the sum of its proper divisors (706963707).
26157655753 is an equidigital number, since it uses as much as digits as its factorization.
26157655753 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 706963706.
The product of its digits is 6615000, while the sum is 52.
The spelling of 26157655753 in words is "twenty-six billion, one hundred fifty-seven million, six hundred fifty-five thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •