Base | Representation |
---|---|
bin | 1100110000010001001… |
… | …0010110110110010101 |
3 | 202221120112000011012222 |
4 | 3030010102112312111 |
5 | 12042222001100031 |
6 | 244354332152125 |
7 | 21554610631001 |
oct | 3140422266625 |
9 | 687515004188 |
10 | 219115253141 |
11 | 84a20936874 |
12 | 36571308645 |
13 | 1787c611055 |
14 | a868a9b701 |
15 | 5a766c7e7b |
hex | 3304496d95 |
219115253141 has 2 divisors, whose sum is σ = 219115253142. Its totient is φ = 219115253140.
The previous prime is 219115253113. The next prime is 219115253143. The reversal of 219115253141 is 141352511912.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 204194630641 + 14920622500 = 451879^2 + 122150^2 .
It is a cyclic number.
It is not a de Polignac number, because 219115253141 - 226 = 219048144277 is a prime.
It is a super-2 number, since 2×2191152531412 (a number of 23 digits) contains 22 as substring.
Together with 219115253143, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (219115253143) 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 as a sum of consecutive naturals, namely, 109557626570 + 109557626571.
It is an arithmetic number, because the mean of its divisors is an integer number (109557626571).
Almost surely, 2219115253141 is an apocalyptic number.
It is an amenable number.
219115253141 is a deficient number, since it is larger than the sum of its proper divisors (1).
219115253141 is an equidigital number, since it uses as much as digits as its factorization.
219115253141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 10800, while the sum is 35.
The spelling of 219115253141 in words is "two hundred nineteen billion, one hundred fifteen million, two hundred fifty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •