Base | Representation |
---|---|
bin | 1001010010111101010011… |
… | …1101111011111101000101 |
3 | 1100012010221222121101020112 |
4 | 2110233110331323331011 |
5 | 2314431210323001313 |
6 | 33423333412242405 |
7 | 2103315230133422 |
oct | 224572475737505 |
9 | 40163858541215 |
10 | 10221300203333 |
11 | 329091355024a |
12 | 1190b58910405 |
13 | 591b3132b9bb |
14 | 2749dc06ad49 |
15 | 12ad2d3638a8 |
hex | 94bd4f7bf45 |
10221300203333 has 2 divisors, whose sum is σ = 10221300203334. Its totient is φ = 10221300203332.
The previous prime is 10221300203311. The next prime is 10221300203353. The reversal of 10221300203333 is 33330200312201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7416134134564 + 2805166068769 = 2723258^2 + 1674863^2 .
It is a cyclic number.
It is not a de Polignac number, because 10221300203333 - 212 = 10221300199237 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10221300203299 and 10221300203308.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10221300203353) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5110650101666 + 5110650101667.
It is an arithmetic number, because the mean of its divisors is an integer number (5110650101667).
Almost surely, 210221300203333 is an apocalyptic number.
It is an amenable number.
10221300203333 is a deficient number, since it is larger than the sum of its proper divisors (1).
10221300203333 is an equidigital number, since it uses as much as digits as its factorization.
10221300203333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 10221300203333 its reverse (33330200312201), we get a palindrome (43551500515534).
The spelling of 10221300203333 in words is "ten trillion, two hundred twenty-one billion, three hundred million, two hundred three thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •