Base | Representation |
---|---|
bin | 1100101000001000010… |
… | …0001100011111011011 |
3 | 202201221021000022220222 |
4 | 3022002010030133123 |
5 | 12023233202040434 |
6 | 243353445310255 |
7 | 21446511563645 |
oct | 3120204143733 |
9 | 681837008828 |
10 | 216930502619 |
11 | 83aaa682426 |
12 | 3606170538b |
13 | 175c1abb76c |
14 | a6dc86d895 |
15 | 59999be72e |
hex | 328210c7db |
216930502619 has 4 divisors (see below), whose sum is σ = 223928260800. Its totient is φ = 209932744440.
The previous prime is 216930502543. The next prime is 216930502631. The reversal of 216930502619 is 916205039612.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 216930502619 - 28 = 216930502363 is a prime.
It is a super-2 number, since 2×2169305026192 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 216930502619.
It is not an unprimeable number, because it can be changed into a prime (216930502639) 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 3 ways as a sum of consecutive naturals, for example, 3498879044 + ... + 3498879105.
It is an arithmetic number, because the mean of its divisors is an integer number (55982065200).
Almost surely, 2216930502619 is an apocalyptic number.
216930502619 is a deficient number, since it is larger than the sum of its proper divisors (6997758181).
216930502619 is an equidigital number, since it uses as much as digits as its factorization.
216930502619 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6997758180.
The product of its (nonzero) digits is 174960, while the sum is 44.
The spelling of 216930502619 in words is "two hundred sixteen billion, nine hundred thirty million, five hundred two thousand, six hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •