Base | Representation |
---|---|
bin | 1001010010111100101100… |
… | …0001011010000110000101 |
3 | 1100012010112100121220020101 |
4 | 2110233023001122012011 |
5 | 2314430340113403221 |
6 | 33423305052004101 |
7 | 2103311132623456 |
oct | 224571301320605 |
9 | 40163470556211 |
10 | 10221133341061 |
11 | 3290838341145 |
12 | 1190b10a60631 |
13 | 591b058a7926 |
14 | 2749c3c3312d |
15 | 12ad1d8a2d91 |
hex | 94bcb05a185 |
10221133341061 has 2 divisors, whose sum is σ = 10221133341062. Its totient is φ = 10221133341060.
The previous prime is 10221133341017. The next prime is 10221133341103. The reversal of 10221133341061 is 16014333112201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7040239689025 + 3180893652036 = 2653345^2 + 1783506^2 .
It is a cyclic number.
It is not a de Polignac number, because 10221133341061 - 221 = 10221131243909 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10221133341161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5110566670530 + 5110566670531.
It is an arithmetic number, because the mean of its divisors is an integer number (5110566670531).
Almost surely, 210221133341061 is an apocalyptic number.
It is an amenable number.
10221133341061 is a deficient number, since it is larger than the sum of its proper divisors (1).
10221133341061 is an equidigital number, since it uses as much as digits as its factorization.
10221133341061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 28.
Adding to 10221133341061 its reverse (16014333112201), we get a palindrome (26235466453262).
The spelling of 10221133341061 in words is "ten trillion, two hundred twenty-one billion, one hundred thirty-three million, three hundred forty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •