Base | Representation |
---|---|
bin | 111011110001111010111… |
… | …1001101101011010110111 |
3 | 1002002110012100100001201010 |
4 | 1313203311321231122313 |
5 | 2034103034333003434 |
6 | 25250231533403303 |
7 | 1505410456230135 |
oct | 167436571553267 |
9 | 32073170301633 |
10 | 8216103016119 |
11 | 268847aa60819 |
12 | b08404339533 |
13 | 477a10127b2b |
14 | 20593926a755 |
15 | e3abde7d9e9 |
hex | 778f5e6d6b7 |
8216103016119 has 32 divisors (see below), whose sum is σ = 11237679006400. Its totient is φ = 5337640488960.
The previous prime is 8216103016073. The next prime is 8216103016133. The reversal of 8216103016119 is 9116103016128.
It is not a de Polignac number, because 8216103016119 - 28 = 8216103015863 is a prime.
It is a super-2 number, since 2×82161030161192 (a number of 27 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 (8216103016189) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 320515527 + ... + 320541159.
It is an arithmetic number, because the mean of its divisors is an integer number (351177468950).
Almost surely, 28216103016119 is an apocalyptic number.
8216103016119 is a deficient number, since it is larger than the sum of its proper divisors (3021575990281).
8216103016119 is a wasteful number, since it uses less digits than its factorization.
8216103016119 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41875.
The product of its (nonzero) digits is 15552, while the sum is 39.
Subtracting 8216103016119 from its reverse (9116103016128), we obtain a palindrome (900000000009).
The spelling of 8216103016119 in words is "eight trillion, two hundred sixteen billion, one hundred three million, sixteen thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •