Base | Representation |
---|---|
bin | 10011000010011100… |
… | …00010000101101001 |
3 | 222101022121202101212 |
4 | 21201032002011221 |
5 | 131413034044423 |
6 | 4410115322505 |
7 | 511200043616 |
oct | 114116020551 |
9 | 28338552355 |
10 | 10221003113 |
11 | 4375542a12 |
12 | 1b92bb0435 |
13 | c6b719649 |
14 | 6cd65150d |
15 | 3ec4b5578 |
hex | 261382169 |
10221003113 has 2 divisors, whose sum is σ = 10221003114. Its totient is φ = 10221003112.
The previous prime is 10221003083. The next prime is 10221003197. The reversal of 10221003113 is 31130012201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6293724889 + 3927278224 = 79333^2 + 62668^2 .
It is an emirp because it is prime and its reverse (31130012201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10221003113 - 230 = 9147261289 is a prime.
It is a super-3 number, since 3×102210031133 (a number of 31 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (10221003613) 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, 5110501556 + 5110501557.
It is an arithmetic number, because the mean of its divisors is an integer number (5110501557).
Almost surely, 210221003113 is an apocalyptic number.
It is an amenable number.
10221003113 is a deficient number, since it is larger than the sum of its proper divisors (1).
10221003113 is an equidigital number, since it uses as much as digits as its factorization.
10221003113 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 10221003113 its reverse (31130012201), we get a palindrome (41351015314).
The spelling of 10221003113 in words is "ten billion, two hundred twenty-one million, three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •