Base | Representation |
---|---|
bin | 1111001101000111… |
… | …10010110000011111 |
3 | 210001220022221122102 |
4 | 13212203302300133 |
5 | 113204224004134 |
6 | 3430003435315 |
7 | 406201201166 |
oct | 74643626037 |
9 | 23056287572 |
10 | 8163109919 |
11 | 3509954338 |
12 | 16b9985b3b |
13 | a01282273 |
14 | 5762063dd |
15 | 32b9b937e |
hex | 1e68f2c1f |
8163109919 has 4 divisors (see below), whose sum is σ = 8163290760. Its totient is φ = 8162929080.
The previous prime is 8163109907. The next prime is 8163109951. The reversal of 8163109919 is 9199013618.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 8163109919 - 28 = 8163109663 is a prime.
It is a super-2 number, since 2×81631099192 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (8163109219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 39872 + ... + 133850.
It is an arithmetic number, because the mean of its divisors is an integer number (2040822690).
Almost surely, 28163109919 is an apocalyptic number.
8163109919 is a deficient number, since it is larger than the sum of its proper divisors (180841).
8163109919 is an equidigital number, since it uses as much as digits as its factorization.
8163109919 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 180840.
The product of its (nonzero) digits is 104976, while the sum is 47.
The square root of 8163109919 is about 90349.9303762875. The cubic root of 8163109919 is about 2013.5011476722.
The spelling of 8163109919 in words is "eight billion, one hundred sixty-three million, one hundred nine thousand, nine hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •