Base | Representation |
---|---|
bin | 1001010010011110100000… |
… | …0010111000101001011101 |
3 | 1100011100121122101102212111 |
4 | 2110213220002320221131 |
5 | 2314312241231124041 |
6 | 33415445032234021 |
7 | 2102603261322355 |
oct | 224475002705135 |
9 | 40140548342774 |
10 | 10213030333021 |
11 | 328835a40828a |
12 | 118b42b23b911 |
13 | 591113c09b09 |
14 | 2744559d3b65 |
15 | 12a9e730b981 |
hex | 949e80b8a5d |
10213030333021 has 2 divisors, whose sum is σ = 10213030333022. Its totient is φ = 10213030333020.
The previous prime is 10213030332977. The next prime is 10213030333159. The reversal of 10213030333021 is 12033303031201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6455690048025 + 3757340284996 = 2540805^2 + 1938386^2 .
It is a cyclic number.
It is not a de Polignac number, because 10213030333021 - 227 = 10212896115293 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10213030332983 and 10213030333001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10213030334021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5106515166510 + 5106515166511.
It is an arithmetic number, because the mean of its divisors is an integer number (5106515166511).
Almost surely, 210213030333021 is an apocalyptic number.
It is an amenable number.
10213030333021 is a deficient number, since it is larger than the sum of its proper divisors (1).
10213030333021 is an equidigital number, since it uses as much as digits as its factorization.
10213030333021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 10213030333021 its reverse (12033303031201), we get a palindrome (22246333364222).
The spelling of 10213030333021 in words is "ten trillion, two hundred thirteen billion, thirty million, three hundred thirty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •