Base | Representation |
---|---|
bin | 11000111111001110… |
… | …001101001111101010 |
3 | 2120020212022020200000 |
4 | 120333032031033222 |
5 | 414422101231100 |
6 | 20154210323430 |
7 | 1636612265433 |
oct | 307716151752 |
9 | 76225266600 |
10 | 26830492650 |
11 | 10419128275 |
12 | 5249589576 |
13 | 26b7841870 |
14 | 142751a48a |
15 | a70750900 |
hex | 63f38d3ea |
26830492650 has 288 divisors, whose sum is σ = 82698540288. Its totient is φ = 6424531200.
The previous prime is 26830492621. The next prime is 26830492679. The reversal of 26830492650 is 5629403862.
26830492650 is a `hidden beast` number, since 26 + 83 + 0 + 492 + 65 + 0 = 666.
It is an interprime number because it is at equal distance from previous prime (26830492621) and next prime (26830492679).
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a junction number, because it is equal to n+sod(n) for n = 26830492596 and 26830492605.
It is an unprimeable number.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 5841855 + ... + 5846445.
Almost surely, 226830492650 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 26830492650, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (41349270144).
26830492650 is an abundant number, since it is smaller than the sum of its proper divisors (55868047638).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26830492650 is a wasteful number, since it uses less digits than its factorization.
26830492650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4668 (or 4651 counting only the distinct ones).
The product of its (nonzero) digits is 622080, while the sum is 45.
The spelling of 26830492650 in words is "twenty-six billion, eight hundred thirty million, four hundred ninety-two thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •