Base | Representation |
---|---|
bin | 110001010001010110111011… |
… | …100011010111000110100101 |
3 | 1001102021001011200111010221012 |
4 | 301101112323203113012211 |
5 | 211400331211142003044 |
6 | 2044513142111032005 |
7 | 63433564634164463 |
oct | 6121267343270645 |
9 | 1042231150433835 |
10 | 216697131594149 |
11 | 63056812558668 |
12 | 20379432b0b605 |
13 | 93bb5b4885b4b |
14 | 3b722a8cd7833 |
15 | 1a0bbca2c459e |
hex | c515bb8d71a5 |
216697131594149 has 2 divisors, whose sum is σ = 216697131594150. Its totient is φ = 216697131594148.
The previous prime is 216697131594103. The next prime is 216697131594191. The reversal of 216697131594149 is 941495131796612.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 157686235353124 + 59010896241025 = 12557318^2 + 7681855^2 .
It is a cyclic number.
It is not a de Polignac number, because 216697131594149 - 212 = 216697131590053 is a prime.
It is a super-2 number, since 2×2166971315941492 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (216697131594049) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 108348565797074 + 108348565797075.
It is an arithmetic number, because the mean of its divisors is an integer number (108348565797075).
Almost surely, 2216697131594149 is an apocalyptic number.
It is an amenable number.
216697131594149 is a deficient number, since it is larger than the sum of its proper divisors (1).
216697131594149 is an equidigital number, since it uses as much as digits as its factorization.
216697131594149 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 88179840, while the sum is 68.
The spelling of 216697131594149 in words is "two hundred sixteen trillion, six hundred ninety-seven billion, one hundred thirty-one million, five hundred ninety-four thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •