Base | Representation |
---|---|
bin | 111101111010… |
… | …001000001011 |
3 | 1010112111211110 |
4 | 331322020023 |
5 | 13123311000 |
6 | 1335501403 |
7 | 254641335 |
oct | 75721013 |
9 | 33474743 |
10 | 16228875 |
11 | 9184aa3 |
12 | 5527863 |
13 | 3492ab0 |
14 | 2226455 |
15 | 1658850 |
hex | f7a20b |
16228875 has 32 divisors (see below), whose sum is σ = 29090880. Its totient is φ = 7987200.
The previous prime is 16228853. The next prime is 16228879. The reversal of 16228875 is 57882261.
It is not a de Polignac number, because 16228875 - 27 = 16228747 is a prime.
It is a Smith number, since the sum of its digits (39) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (39).
Its product of digits (53760) is a multiple of the sum of its prime factors (3360).
It is not an unprimeable number, because it can be changed into a prime (16228879) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 3211 + ... + 6539.
It is an arithmetic number, because the mean of its divisors is an integer number (909090).
Almost surely, 216228875 is an apocalyptic number.
16228875 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
16228875 is a deficient number, since it is larger than the sum of its proper divisors (12862005).
16228875 is a wasteful number, since it uses less digits than its factorization.
16228875 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3360 (or 3350 counting only the distinct ones).
The product of its digits is 53760, while the sum is 39.
The square root of 16228875 is about 4028.5077882511. The cubic root of 16228875 is about 253.1800444230.
The spelling of 16228875 in words is "sixteen million, two hundred twenty-eight thousand, eight hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •