Base | Representation |
---|---|
bin | 10010110100000011… |
… | …01000110010000101 |
3 | 222001220112001222212 |
4 | 21122001220302011 |
5 | 131141140010341 |
6 | 4350124433205 |
7 | 505203150215 |
oct | 113201506205 |
9 | 28056461885 |
10 | 10100313221 |
11 | 43133aa8a9 |
12 | 1b5a6a8805 |
13 | c4c7106cb |
14 | 6bb5d6245 |
15 | 3e1ac55eb |
hex | 25a068c85 |
10100313221 has 2 divisors, whose sum is σ = 10100313222. Its totient is φ = 10100313220.
The previous prime is 10100313193. The next prime is 10100313229. The reversal of 10100313221 is 12231300101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9348182596 + 752130625 = 96686^2 + 27425^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10100313221 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10100313196 and 10100313205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10100313229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050156610 + 5050156611.
It is an arithmetic number, because the mean of its divisors is an integer number (5050156611).
Almost surely, 210100313221 is an apocalyptic number.
It is an amenable number.
10100313221 is a deficient number, since it is larger than the sum of its proper divisors (1).
10100313221 is an equidigital number, since it uses as much as digits as its factorization.
10100313221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 10100313221 its reverse (12231300101), we get a palindrome (22331613322).
The spelling of 10100313221 in words is "ten billion, one hundred million, three hundred thirteen thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •