Base | Representation |
---|---|
bin | 11010000101111… |
… | …00011110010001 |
3 | 120020212001010212 |
4 | 31002330132101 |
5 | 422013011133 |
6 | 33415133505 |
7 | 5265261563 |
oct | 1502743621 |
9 | 506761125 |
10 | 218875793 |
11 | 102605694 |
12 | 61374295 |
13 | 36465b06 |
14 | 210d7333 |
15 | 14337148 |
hex | d0bc791 |
218875793 has 2 divisors, whose sum is σ = 218875794. Its totient is φ = 218875792.
The previous prime is 218875739. The next prime is 218875817. The reversal of 218875793 is 397578812.
218875793 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with previous prime (218875739) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 214827649 + 4048144 = 14657^2 + 2012^2 .
It is a cyclic number.
It is not a de Polignac number, because 218875793 - 26 = 218875729 is a prime.
It is a super-2 number, since 2×2188757932 = 95813225522757698, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (218875733) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 109437896 + 109437897.
It is an arithmetic number, because the mean of its divisors is an integer number (109437897).
Almost surely, 2218875793 is an apocalyptic number.
It is an amenable number.
218875793 is a deficient number, since it is larger than the sum of its proper divisors (1).
218875793 is an equidigital number, since it uses as much as digits as its factorization.
218875793 is an evil number, because the sum of its binary digits is even.
The product of its digits is 846720, while the sum is 50.
The square root of 218875793 is about 14794.4514261259. The cubic root of 218875793 is about 602.6510406837.
The spelling of 218875793 in words is "two hundred eighteen million, eight hundred seventy-five thousand, seven hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •