Base | Representation |
---|---|
bin | 10011001111000011… |
… | …00001010011101101 |
3 | 222122200122112011221 |
4 | 21213201201103231 |
5 | 132122123300041 |
6 | 4424414343341 |
7 | 513623065543 |
oct | 114741412355 |
9 | 28580575157 |
10 | 10326775021 |
11 | 441a216a12 |
12 | 20024bab51 |
13 | c87601384 |
14 | 6dd705d93 |
15 | 40690a2d1 |
hex | 2678614ed |
10326775021 has 2 divisors, whose sum is σ = 10326775022. Its totient is φ = 10326775020.
The previous prime is 10326774971. The next prime is 10326775031. The reversal of 10326775021 is 12057762301.
10326775021 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9406866121 + 919908900 = 96989^2 + 30330^2 .
It is a cyclic number.
It is not a de Polignac number, because 10326775021 - 27 = 10326774893 is a prime.
It is a super-3 number, since 3×103267750213 (a number of 31 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10326775031) 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, 5163387510 + 5163387511.
It is an arithmetic number, because the mean of its divisors is an integer number (5163387511).
Almost surely, 210326775021 is an apocalyptic number.
It is an amenable number.
10326775021 is a deficient number, since it is larger than the sum of its proper divisors (1).
10326775021 is an equidigital number, since it uses as much as digits as its factorization.
10326775021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17640, while the sum is 34.
The spelling of 10326775021 in words is "ten billion, three hundred twenty-six million, seven hundred seventy-five thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •