Base | Representation |
---|---|
bin | 11010010101111110… |
… | …101110001100001001 |
3 | 2201000022012021110112 |
4 | 122111332232030021 |
5 | 430412212113311 |
6 | 20554444124105 |
7 | 2020645316141 |
oct | 322576561411 |
9 | 81008167415 |
10 | 28286051081 |
11 | 10aa5813922 |
12 | 5594b36635 |
13 | 288a273742 |
14 | 1524971921 |
15 | b0841c28b |
hex | 695fae309 |
28286051081 has 8 divisors (see below), whose sum is σ = 29013179400. Its totient is φ = 27566086912.
The previous prime is 28286051039. The next prime is 28286051083. The reversal of 28286051081 is 18015068282.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 10549138681 + 17736912400 = 102709^2 + 133180^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 28286051081 - 222 = 28281856777 is a prime.
It is a super-2 number, since 2×282860510812 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (28286051083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1783040 + ... + 1798833.
It is an arithmetic number, because the mean of its divisors is an integer number (3626647425).
Almost surely, 228286051081 is an apocalyptic number.
It is an amenable number.
28286051081 is a deficient number, since it is larger than the sum of its proper divisors (727128319).
28286051081 is a wasteful number, since it uses less digits than its factorization.
28286051081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3582075.
The product of its (nonzero) digits is 61440, while the sum is 41.
The spelling of 28286051081 in words is "twenty-eight billion, two hundred eighty-six million, fifty-one thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •