Base | Representation |
---|---|
bin | 11110001101000100… |
… | …10101100101000111 |
3 | 1112212002212120200210 |
4 | 33012202111211013 |
5 | 231202220320233 |
6 | 11241024410503 |
7 | 1112561646231 |
oct | 170642254507 |
9 | 45762776623 |
10 | 16215791943 |
11 | 697143454a |
12 | 3186776a33 |
13 | 16b56ac480 |
14 | adb8a5251 |
15 | 64d91e163 |
hex | 3c6895947 |
16215791943 has 32 divisors (see below), whose sum is σ = 23476504576. Its totient is φ = 9896784768.
The previous prime is 16215791941. The next prime is 16215791947. The reversal of 16215791943 is 34919751261.
16215791943 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 16215791943 - 21 = 16215791941 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 16215791892 and 16215791901.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16215791941) 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 31 ways as a sum of consecutive naturals, for example, 3714480 + ... + 3718842.
It is an arithmetic number, because the mean of its divisors is an integer number (733640768).
Almost surely, 216215791943 is an apocalyptic number.
16215791943 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
16215791943 is a deficient number, since it is larger than the sum of its proper divisors (7260712633).
16215791943 is a wasteful number, since it uses less digits than its factorization.
16215791943 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5143.
The product of its digits is 408240, while the sum is 48.
The spelling of 16215791943 in words is "sixteen billion, two hundred fifteen million, seven hundred ninety-one thousand, nine hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •