Base | Representation |
---|---|
bin | 11110001100110111… |
… | …01110100000000000 |
3 | 1112211222121112120000 |
4 | 33012123232200000 |
5 | 231201244342013 |
6 | 11240523320000 |
7 | 1112541141030 |
oct | 170633564000 |
9 | 45758545500 |
10 | 16214059008 |
11 | 6970460574 |
12 | 3186080000 |
13 | 16b5223774 |
14 | adb5738c0 |
15 | 64d6ca973 |
hex | 3c66ee800 |
16214059008 has 240 divisors, whose sum is σ = 55352737440. Its totient is φ = 4632256512.
The previous prime is 16214058997. The next prime is 16214059039. The reversal of 16214059008 is 80095041261.
16214059008 is a `hidden beast` number, since 1 + 6 + 21 + 40 + 590 + 0 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 1154235 + ... + 1168197.
It is an arithmetic number, because the mean of its divisors is an integer number (230636406).
Almost surely, 216214059008 is an apocalyptic number.
16214059008 is a gapful number since it is divisible by the number (18) 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 16214059008, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27676368720).
16214059008 is an abundant number, since it is smaller than the sum of its proper divisors (39138678432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16214059008 is an equidigital number, since it uses as much as digits as its factorization.
16214059008 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14004 (or 13975 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 36.
The spelling of 16214059008 in words is "sixteen billion, two hundred fourteen million, fifty-nine thousand, eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •