Base | Representation |
---|---|
bin | 11000101100100000… |
… | …101000011000111000 |
3 | 2112102222120120121111 |
4 | 120230200220120320 |
5 | 413301214232240 |
6 | 20103113450104 |
7 | 1626051000313 |
oct | 305440503070 |
9 | 75388516544 |
10 | 26516555320 |
11 | 102779a4532 |
12 | 5180410934 |
13 | 26677a4028 |
14 | 13d795997a |
15 | a52ddc1ea |
hex | 62c828638 |
26516555320 has 16 divisors (see below), whose sum is σ = 59662249560. Its totient is φ = 10606622112.
The previous prime is 26516555237. The next prime is 26516555327. The reversal of 26516555320 is 2355561562.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (40), and also a Moran number because the ratio is a prime number: 662913883 = 26516555320 / (2 + 6 + 5 + 1 + 6 + 5 + 5 + 5 + 3 + 2 + 0).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26516555327) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 331456902 + ... + 331456981.
Almost surely, 226516555320 is an apocalyptic number.
26516555320 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
26516555320 is an abundant number, since it is smaller than the sum of its proper divisors (33145694240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26516555320 is a wasteful number, since it uses less digits than its factorization.
26516555320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 662913894 (or 662913890 counting only the distinct ones).
The product of its (nonzero) digits is 270000, while the sum is 40.
The spelling of 26516555320 in words is "twenty-six billion, five hundred sixteen million, five hundred fifty-five thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •