Base | Representation |
---|---|
bin | 11000101100100000… |
… | …111001011011110100 |
3 | 2112102222201010101102 |
4 | 120230200321123310 |
5 | 413301224001030 |
6 | 20103115145232 |
7 | 1626051411005 |
oct | 305440713364 |
9 | 75388633342 |
10 | 26516625140 |
11 | 10277a41a35 |
12 | 5180445218 |
13 | 26677c9a45 |
14 | 13d79771ac |
15 | a52e02c45 |
hex | 62c8396f4 |
26516625140 has 24 divisors (see below), whose sum is σ = 55702551912. Its totient is φ = 10603290240.
The previous prime is 26516625137. The next prime is 26516625151. The reversal of 26516625140 is 4152661562.
It can be written as a sum of positive squares in 4 ways, for example, as 2621030416 + 23895594724 = 51196^2 + 154582^2 .
It is a junction number, because it is equal to n+sod(n) for n = 26516625094 and 26516625103.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 144779 + ... + 272018.
It is an arithmetic number, because the mean of its divisors is an integer number (2320939663).
Almost surely, 226516625140 is an apocalyptic number.
26516625140 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
26516625140 is an abundant number, since it is smaller than the sum of its proper divisors (29185926772).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26516625140 is a wasteful number, since it uses less digits than its factorization.
26516625140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 419987 (or 419985 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 38.
The spelling of 26516625140 in words is "twenty-six billion, five hundred sixteen million, six hundred twenty-five thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •