Base | Representation |
---|---|
bin | 11010101010000111… |
… | …010001001101100101 |
3 | 2201212211210112021021 |
4 | 122222013101031211 |
5 | 432110200223010 |
6 | 21052152051141 |
7 | 2032216406632 |
oct | 325207211545 |
9 | 81784715237 |
10 | 28623836005 |
11 | 11159455716 |
12 | 566a093ab1 |
13 | 2912240a8b |
14 | 155777d189 |
15 | b27de18da |
hex | 6aa1d1365 |
28623836005 has 4 divisors (see below), whose sum is σ = 34348603212. Its totient is φ = 22899068800.
The previous prime is 28623835997. The next prime is 28623836009. The reversal of 28623836005 is 50063832682.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 6056886276 + 22566949729 = 77826^2 + 150223^2 .
It is not a de Polignac number, because 28623836005 - 23 = 28623835997 is a prime.
It is a super-2 number, since 2×286238360052 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28623836009) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 2862383596 + ... + 2862383605.
It is an arithmetic number, because the mean of its divisors is an integer number (8587150803).
Almost surely, 228623836005 is an apocalyptic number.
It is an amenable number.
28623836005 is a deficient number, since it is larger than the sum of its proper divisors (5724767207).
28623836005 is an equidigital number, since it uses as much as digits as its factorization.
28623836005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5724767206.
The product of its (nonzero) digits is 414720, while the sum is 43.
The spelling of 28623836005 in words is "twenty-eight billion, six hundred twenty-three million, eight hundred thirty-six thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •