Base | Representation |
---|---|
bin | 111101010011… |
… | …100101100100 |
3 | 1010020111021200 |
4 | 331103211210 |
5 | 13103233022 |
6 | 1332242500 |
7 | 253413156 |
oct | 75234544 |
9 | 33214250 |
10 | 16071012 |
11 | 9087431 |
12 | 5470430 |
13 | 3438c99 |
14 | 21c4ad6 |
15 | 1626bac |
hex | f53964 |
16071012 has 18 divisors (see below), whose sum is σ = 40624038. Its totient is φ = 5356992.
The previous prime is 16071007. The next prime is 16071053. The reversal of 16071012 is 21017061.
It can be written as a sum of positive squares in only one way, i.e., 12916836 + 3154176 = 3594^2 + 1776^2 .
It is a tau number, because it is divible by the number of its divisors (18).
It is a Harshad number since it is a multiple of its sum of digits (18).
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 5 ways as a sum of consecutive naturals, for example, 223173 + ... + 223244.
It is an arithmetic number, because the mean of its divisors is an integer number (2256891).
Almost surely, 216071012 is an apocalyptic number.
16071012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
16071012 is an abundant number, since it is smaller than the sum of its proper divisors (24553026).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16071012 is a wasteful number, since it uses less digits than its factorization.
16071012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 446427 (or 446422 counting only the distinct ones).
The product of its (nonzero) digits is 84, while the sum is 18.
The square root of 16071012 is about 4008.8666727643. The cubic root of 16071012 is about 252.3564494636.
Adding to 16071012 its reverse (21017061), we get a palindrome (37088073).
The spelling of 16071012 in words is "sixteen million, seventy-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •