Base | Representation |
---|---|
bin | 1100011111001011100… |
… | …0100010001001010001 |
3 | 202111201211211222111112 |
4 | 3013302320202021101 |
5 | 12003323221204242 |
6 | 242315234023105 |
7 | 21333132331361 |
oct | 3076270421121 |
9 | 674654758445 |
10 | 214528303697 |
11 | 82a876a8864 |
12 | 356b1117a95 |
13 | 172cb212c96 |
14 | a5517da9a1 |
15 | 58a8b61c82 |
hex | 31f2e22251 |
214528303697 has 2 divisors, whose sum is σ = 214528303698. Its totient is φ = 214528303696.
The previous prime is 214528303571. The next prime is 214528303729. The reversal of 214528303697 is 796303825412.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 114747497536 + 99780806161 = 338744^2 + 315881^2 .
It is a cyclic number.
It is not a de Polignac number, because 214528303697 - 214 = 214528287313 is a prime.
It is a super-2 number, since 2×2145283036972 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (214528302697) 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, 107264151848 + 107264151849.
It is an arithmetic number, because the mean of its divisors is an integer number (107264151849).
It is a 1-persistent number, because it is pandigital, but 2⋅214528303697 = 429056607394 is not.
Almost surely, 2214528303697 is an apocalyptic number.
It is an amenable number.
214528303697 is a deficient number, since it is larger than the sum of its proper divisors (1).
214528303697 is an equidigital number, since it uses as much as digits as its factorization.
214528303697 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2177280, while the sum is 50.
The spelling of 214528303697 in words is "two hundred fourteen billion, five hundred twenty-eight million, three hundred three thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •