Base | Representation |
---|---|
bin | 111101001110… |
… | …111100100000 |
3 | 1010012112012112 |
4 | 331032330200 |
5 | 13102131000 |
6 | 1332014452 |
7 | 253303556 |
oct | 75167440 |
9 | 33175175 |
10 | 16052000 |
11 | 9074118 |
12 | 5461428 |
13 | 3430433 |
14 | 21bbbd6 |
15 | 1621235 |
hex | f4ef20 |
16052000 has 48 divisors (see below), whose sum is σ = 39449592. Its totient is φ = 6419200.
The previous prime is 16051991. The next prime is 16052027. The reversal of 16052000 is 25061.
16052000 = T443 + T444 + ... + T567.
It can be written as a sum of positive squares in 4 ways, for example, as 7595536 + 8456464 = 2756^2 + 2908^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 7 ways as a sum of consecutive naturals, for example, 1994 + ... + 6006.
Almost surely, 216052000 is an apocalyptic number.
16052000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 16052000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19724796).
16052000 is an abundant number, since it is smaller than the sum of its proper divisors (23397592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16052000 is an equidigital number, since it uses as much as digits as its factorization.
16052000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4038 (or 4020 counting only the distinct ones).
The product of its (nonzero) digits is 60, while the sum is 14.
The square root of 16052000 is about 4006.4947273146. The cubic root of 16052000 is about 252.2568976745.
Adding to 16052000 its reverse (25061), we get a palindrome (16077061).
The spelling of 16052000 in words is "sixteen million, fifty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •