Base | Representation |
---|---|
bin | 10011000001010001… |
… | …01011100110110001 |
3 | 222100122012022002211 |
4 | 21200220223212301 |
5 | 131403032233242 |
6 | 4405125412121 |
7 | 511020603331 |
oct | 114050534661 |
9 | 28318168084 |
10 | 10211211697 |
11 | 436aa65535 |
12 | 1b8b86a041 |
13 | c6969b9cb |
14 | 6cc2230c1 |
15 | 3eb6ce317 |
hex | 260a2b9b1 |
10211211697 has 2 divisors, whose sum is σ = 10211211698. Its totient is φ = 10211211696.
The previous prime is 10211211679. The next prime is 10211211707. The reversal of 10211211697 is 79611211201.
Together with previous prime (10211211679) 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., 8871944481 + 1339267216 = 94191^2 + 36596^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10211211697 is a prime.
It is not a weakly prime, because it can be changed into another prime (10211211617) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5105605848 + 5105605849.
It is an arithmetic number, because the mean of its divisors is an integer number (5105605849).
Almost surely, 210211211697 is an apocalyptic number.
It is an amenable number.
10211211697 is a deficient number, since it is larger than the sum of its proper divisors (1).
10211211697 is an equidigital number, since it uses as much as digits as its factorization.
10211211697 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 31.
Adding to 10211211697 its reverse (79611211201), we get a palindrome (89822422898).
The spelling of 10211211697 in words is "ten billion, two hundred eleven million, two hundred eleven thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •