Base | Representation |
---|---|
bin | 110101011011… |
… | …0101001001010 |
3 | 1221201002222111 |
4 | 1222312221022 |
5 | 24132323312 |
6 | 2440212534 |
7 | 460042651 |
oct | 152665112 |
9 | 57632874 |
10 | 28011082 |
11 | 148a2160 |
12 | 946a14a |
13 | 5a59908 |
14 | 3a12198 |
15 | 26d48a7 |
hex | 1ab6a4a |
28011082 has 8 divisors (see below), whose sum is σ = 45836352. Its totient is φ = 12732300.
The previous prime is 28011031. The next prime is 28011091.
28011082 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×280110823 (a number of 23 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 1273231 = 28011082 / (2 + 8 + 0 + 1 + 1 + 0 + 8 + 2).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 636594 + ... + 636637.
It is an arithmetic number, because the mean of its divisors is an integer number (5729544).
Almost surely, 228011082 is an apocalyptic number.
28011082 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
28011082 is a deficient number, since it is larger than the sum of its proper divisors (17825270).
28011082 is a wasteful number, since it uses less digits than its factorization.
28011082 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1273244.
The product of its (nonzero) digits is 256, while the sum is 22.
The square root of 28011082 is about 5292.5496691103. The cubic root of 28011082 is about 303.6989531880.
It can be divided in two parts, 2801 and 1082, that added together give a palindrome (3883).
The spelling of 28011082 in words is "twenty-eight million, eleven thousand, eighty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •