Base | Representation |
---|---|
bin | 11101110100000110… |
… | …01100000111000101 |
3 | 1112022111200021220200 |
4 | 32322003030013011 |
5 | 230240103100401 |
6 | 11204142321113 |
7 | 1104436206651 |
oct | 167203140705 |
9 | 45274607820 |
10 | 16006300101 |
11 | 68741591a0 |
12 | 3128589199 |
13 | 16811809bc |
14 | abbb31a61 |
15 | 63a33c686 |
hex | 3ba0cc1c5 |
16006300101 has 12 divisors (see below), whose sum is σ = 25222048800. Its totient is φ = 9700787880.
The previous prime is 16006300099. The next prime is 16006300183. The reversal of 16006300101 is 10100360061.
16006300101 is a `hidden beast` number, since 1 + 600 + 63 + 0 + 0 + 1 + 0 + 1 = 666.
It is not a de Polignac number, because 16006300101 - 21 = 16006300099 is a prime.
It is a super-2 number, since 2×160063001012 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16006300801) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 80839801 + ... + 80839998.
It is an arithmetic number, because the mean of its divisors is an integer number (2101837400).
Almost surely, 216006300101 is an apocalyptic number.
16006300101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
16006300101 is a deficient number, since it is larger than the sum of its proper divisors (9215748699).
16006300101 is a wasteful number, since it uses less digits than its factorization.
16006300101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 161679816 (or 161679813 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 16006300101 its reverse (10100360061), we get a palindrome (26106660162).
The spelling of 16006300101 in words is "sixteen billion, six million, three hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •