Base | Representation |
---|---|
bin | 11110000100011001… |
… | …01010001000100100 |
3 | 1112200000220101001121 |
4 | 33002030222020210 |
5 | 231030102000400 |
6 | 11225504303324 |
7 | 1111016144143 |
oct | 170214521044 |
9 | 45600811047 |
10 | 16143000100 |
11 | 69343369a7 |
12 | 3166311b44 |
13 | 16a35a3c86 |
14 | ad1d5775a |
15 | 64734121a |
hex | 3c232a224 |
16143000100 has 72 divisors (see below), whose sum is σ = 36514607360. Its totient is φ = 6188814720.
The previous prime is 16143000059. The next prime is 16143000103. The reversal of 16143000100 is 100034161.
It is not an unprimeable number, because it can be changed into a prime (16143000103) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 215341 + ... + 280459.
Almost surely, 216143000100 is an apocalyptic number.
16143000100 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 16143000100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18257303680).
16143000100 is an abundant number, since it is smaller than the sum of its proper divisors (20371607260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16143000100 is a wasteful number, since it uses less digits than its factorization.
16143000100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65237 (or 65230 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 16143000100 its reverse (100034161), we get a palindrome (16243034261).
The spelling of 16143000100 in words is "sixteen billion, one hundred forty-three million, one hundred", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •