Base | Representation |
---|---|
bin | 111101000101… |
… | …100001000000 |
3 | 1010010120020000 |
4 | 331011201000 |
5 | 13044412001 |
6 | 1331120000 |
7 | 253053141 |
oct | 75054100 |
9 | 33116200 |
10 | 16013376 |
11 | 90480a5 |
12 | 5443000 |
13 | 3418992 |
14 | 21abac8 |
15 | 1614a86 |
hex | f45840 |
16013376 has 70 divisors (see below), whose sum is σ = 47484030. Its totient is φ = 5336064.
The previous prime is 16013363. The next prime is 16013377. The reversal of 16013376 is 67331061.
It can be written as a sum of positive squares in only one way, i.e., 15681600 + 331776 = 3960^2 + 576^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a nialpdrome in base 12.
It is not an unprimeable number, because it can be changed into a prime (16013377) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 3640 + ... + 6728.
Almost surely, 216013376 is an apocalyptic number.
16013376 is a gapful number since it is divisible by the number (16) 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 16013376, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23742015).
16013376 is an abundant number, since it is smaller than the sum of its proper divisors (31470654).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16013376 is an equidigital number, since it uses as much as digits as its factorization.
16013376 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3113 (or 3094 counting only the distinct ones).
The product of its (nonzero) digits is 2268, while the sum is 27.
The square root of 16013376 is about 4001.6716506980. The cubic root of 16013376 is about 252.0544100200.
The spelling of 16013376 in words is "sixteen million, thirteen thousand, three hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •