Base | Representation |
---|---|
bin | 1100110010001011111011… |
… | …10110100100010100010011 |
3 | 10200112112201110212022122201 |
4 | 12121011331312210110103 |
5 | 12141044223114040401 |
6 | 135442441114544031 |
7 | 5631034141511062 |
oct | 631057566442423 |
9 | 120475643768581 |
10 | 28112672408851 |
11 | 8a59576751738 |
12 | 31a0511138017 |
13 | 128c023c4aab4 |
14 | 6d29369b01d9 |
15 | 33b41d828b01 |
hex | 19917dda4513 |
28112672408851 has 4 divisors (see below), whose sum is σ = 28126749863232. Its totient is φ = 28098594954472.
The previous prime is 28112672408831. The next prime is 28112672408857. The reversal of 28112672408851 is 15880427621182.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 28112672408851 - 211 = 28112672406803 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 28112672408792 and 28112672408801.
It is not an unprimeable number, because it can be changed into a prime (28112672408857) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7038724195 + ... + 7038728188.
It is an arithmetic number, because the mean of its divisors is an integer number (7031687465808).
Almost surely, 228112672408851 is an apocalyptic number.
28112672408851 is a deficient number, since it is larger than the sum of its proper divisors (14077454381).
28112672408851 is a wasteful number, since it uses less digits than its factorization.
28112672408851 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14077454380.
The product of its (nonzero) digits is 3440640, while the sum is 55.
The spelling of 28112672408851 in words is "twenty-eight trillion, one hundred twelve billion, six hundred seventy-two million, four hundred eight thousand, eight hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •