Base | Representation |
---|---|
bin | 11010111000110111… |
… | …110101001000010000 |
3 | 2202112002201110202221 |
4 | 122320313311020100 |
5 | 433112042301211 |
6 | 21132515150424 |
7 | 2041314152014 |
oct | 327067651020 |
9 | 82462643687 |
10 | 28871447056 |
11 | 112761a7551 |
12 | 5718ba5414 |
13 | 2951627caa |
14 | 157c5d6544 |
15 | b3ea02c71 |
hex | 6b8df5210 |
28871447056 has 45 divisors (see below), whose sum is σ = 56608693869. Its totient is φ = 14264788032.
The previous prime is 28871447053. The next prime is 28871447057. The reversal of 28871447056 is 65074417882.
The square root of 28871447056 is 169916.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 19348810000 + 9522637056 = 139100^2 + 97584^2 .
It is a super-2 number, since 2×288714470562 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 28871446994 and 28871447012.
It is not an unprimeable number, because it can be changed into a prime (28871447053) 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 8 ways as a sum of consecutive naturals, for example, 72723850 + ... + 72724246.
Almost surely, 228871447056 is an apocalyptic number.
28871447056 is the 169916-th square number.
It is an amenable number.
28871447056 is a deficient number, since it is larger than the sum of its proper divisors (27737246813).
28871447056 is an frugal number, since it uses more digits than its factorization.
28871447056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1016 (or 506 counting only the distinct ones).
The product of its (nonzero) digits is 3010560, while the sum is 52.
The spelling of 28871447056 in words is "twenty-eight billion, eight hundred seventy-one million, four hundred forty-seven thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •