Base | Representation |
---|---|
bin | 1100110101001010101000… |
… | …01000011111110100011011 |
3 | 10200220022222110112012210000 |
4 | 12122211110020133310123 |
5 | 12144233411212243201 |
6 | 140001452114024043 |
7 | 5641320166123164 |
oct | 632452410376433 |
9 | 120808873465700 |
10 | 28215051681051 |
11 | 8a98a331221a4 |
12 | 31b8323878023 |
13 | 129888b6696c1 |
14 | 6d7889a1676b |
15 | 33de11892d86 |
hex | 19a95421fd1b |
28215051681051 has 40 divisors (see below), whose sum is σ = 44916715160064. Its totient is φ = 17609393902320.
The previous prime is 28215051681013. The next prime is 28215051681107. The reversal of 28215051681051 is 15018615051282.
28215051681051 is a `hidden beast` number, since 2 + 8 + 2 + 1 + 5 + 0 + 516 + 81 + 0 + 51 = 666.
It is not a de Polignac number, because 28215051681051 - 27 = 28215051680923 is a prime.
It is a super-2 number, since 2×282150516810512 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 28215051680988 and 28215051681006.
It is not an unprimeable number, because it can be changed into a prime (28215051683051) 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 39 ways as a sum of consecutive naturals, for example, 161028985 + ... + 161204106.
Almost surely, 228215051681051 is an apocalyptic number.
28215051681051 is a deficient number, since it is larger than the sum of its proper divisors (16701663479013).
28215051681051 is a wasteful number, since it uses less digits than its factorization.
28215051681051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 322233173 (or 322233164 counting only the distinct ones).
The product of its (nonzero) digits is 192000, while the sum is 45.
The spelling of 28215051681051 in words is "twenty-eight trillion, two hundred fifteen billion, fifty-one million, six hundred eighty-one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •