Base | Representation |
---|---|
bin | 111101000010… |
… | …010100001000 |
3 | 1010002220020101 |
4 | 331002110020 |
5 | 13044002024 |
6 | 1330535144 |
7 | 253000000 |
oct | 75022410 |
9 | 33086211 |
10 | 16000264 |
11 | 9039265 |
12 | 54374b4 |
13 | 3412a17 |
14 | 21a7000 |
15 | 1610c44 |
hex | f42508 |
16000264 has 56 divisors (see below), whose sum is σ = 37059390. Its totient is φ = 6453888.
The previous prime is 16000253. The next prime is 16000277. The reversal of 16000264 is 46200061.
It can be written as a sum of positive squares in only one way, i.e., 11764900 + 4235364 = 3430^2 + 2058^2 .
It is a tau number, because it is divible by the number of its divisors (56).
16000264 is a modest number, since divided by 264 gives 16 as remainder.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 13 ways as a sum of consecutive naturals, for example, 941184 + ... + 941200.
Almost surely, 216000264 is an apocalyptic number.
16000264 is a gapful number since it is divisible by the number (14) 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 16000264, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18529695).
16000264 is an abundant number, since it is smaller than the sum of its proper divisors (21059126).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16000264 is an frugal number, since it uses more digits than its factorization.
16000264 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65 (or 26 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 19.
The square root of 16000264 is about 4000.0329998639. The cubic root of 16000264 is about 251.9855958845.
The spelling of 16000264 in words is "sixteen million, two hundred sixty-four", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •