Base | Representation |
---|---|
bin | 11000001111011100… |
… | …100011111010000010 |
3 | 2111012000001121122200 |
4 | 120033130203322002 |
5 | 411301402332442 |
6 | 15542454414030 |
7 | 1611010263021 |
oct | 301734437202 |
9 | 74160047580 |
10 | 26028949122 |
11 | 10047732800 |
12 | 5065061316 |
13 | 25ba76b257 |
14 | 138ccac8b8 |
15 | a251c134c |
hex | 60f723e82 |
26028949122 has 54 divisors (see below), whose sum is σ = 62006990409. Its totient is φ = 7885278720.
The previous prime is 26028949117. The next prime is 26028949139. The reversal of 26028949122 is 22194982062.
26028949122 is a `hidden beast` number, since 2 + 60 + 2 + 89 + 491 + 22 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 16116556401 + 9912392721 = 126951^2 + 99561^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=114081.
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 26 ways as a sum of consecutive naturals, for example, 7527618 + ... + 7531074.
Almost surely, 226028949122 is an apocalyptic number.
26028949122 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 26028949122
26028949122 is an abundant number, since it is smaller than the sum of its proper divisors (35978041287).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26028949122 is an equidigital number, since it uses as much as digits as its factorization.
26028949122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6944 (or 3473 counting only the distinct ones).
The product of its (nonzero) digits is 248832, while the sum is 45.
The spelling of 26028949122 in words is "twenty-six billion, twenty-eight million, nine hundred forty-nine thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •