Base | Representation |
---|---|
bin | 11000010101100110… |
… | …011011110001010101 |
3 | 2111110012100022222000 |
4 | 120111212123301111 |
5 | 412004320404113 |
6 | 20001023425513 |
7 | 1613403016365 |
oct | 302546336125 |
9 | 74405308860 |
10 | 26132200533 |
11 | 1009aa4504a |
12 | 5093755299 |
13 | 2605c7c96a |
14 | 139c8a89a5 |
15 | a2e2b9373 |
hex | 61599bc55 |
26132200533 has 32 divisors (see below), whose sum is σ = 38843969280. Its totient is φ = 17363263680.
The previous prime is 26132200529. The next prime is 26132200537. The reversal of 26132200533 is 33500223162.
It is an interprime number because it is at equal distance from previous prime (26132200529) and next prime (26132200537).
It is not a de Polignac number, because 26132200533 - 22 = 26132200529 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 26132200497 and 26132200506.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26132200537) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 19032235 + ... + 19033607.
It is an arithmetic number, because the mean of its divisors is an integer number (1213874040).
Almost surely, 226132200533 is an apocalyptic number.
It is an amenable number.
26132200533 is a deficient number, since it is larger than the sum of its proper divisors (12711768747).
26132200533 is a wasteful number, since it uses less digits than its factorization.
26132200533 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3226 (or 3220 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 27.
Adding to 26132200533 its reverse (33500223162), we get a palindrome (59632423695).
The spelling of 26132200533 in words is "twenty-six billion, one hundred thirty-two million, two hundred thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •