Base | Representation |
---|---|
bin | 11101110110000111… |
… | …10101100001000001 |
3 | 1112100200120021120101 |
4 | 32323003311201001 |
5 | 230303422400123 |
6 | 11205545442401 |
7 | 1105033231402 |
oct | 167303654101 |
9 | 45320507511 |
10 | 16023246913 |
11 | 6882783623 |
12 | 31321a0401 |
13 | 16848354bb |
14 | ac00a39a9 |
15 | 63ba88aad |
hex | 3bb0f5841 |
16023246913 has 8 divisors (see below), whose sum is σ = 16272087200. Its totient is φ = 15774691680.
The previous prime is 16023246893. The next prime is 16023246937. The reversal of 16023246913 is 31964232061.
16023246913 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-16023246913 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (16023246413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 43453 + ... + 184213.
It is an arithmetic number, because the mean of its divisors is an integer number (2034010900).
Almost surely, 216023246913 is an apocalyptic number.
It is an amenable number.
16023246913 is a deficient number, since it is larger than the sum of its proper divisors (248840287).
16023246913 is a wasteful number, since it uses less digits than its factorization.
16023246913 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 142527.
The product of its (nonzero) digits is 46656, while the sum is 37.
Adding to 16023246913 its reverse (31964232061), we get a palindrome (47987478974).
The spelling of 16023246913 in words is "sixteen billion, twenty-three million, two hundred forty-six thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •