Base | Representation |
---|---|
bin | 1001010010010011100110… |
… | …0000010001000001000101 |
3 | 1100011002001120020211121122 |
4 | 2110210321200101001011 |
5 | 2314240242104202323 |
6 | 33414242304323325 |
7 | 2102440563150152 |
oct | 224447140210105 |
9 | 40132046224548 |
10 | 10210102022213 |
11 | 3287097462005 |
12 | 118a952613545 |
13 | 590a68335c22 |
14 | 274258b2d229 |
15 | 12a8c51c8ec8 |
hex | 94939811045 |
10210102022213 has 2 divisors, whose sum is σ = 10210102022214. Its totient is φ = 10210102022212.
The previous prime is 10210102022201. The next prime is 10210102022243. The reversal of 10210102022213 is 31222020101201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9856793039809 + 353308982404 = 3139553^2 + 594398^2 .
It is a cyclic number.
It is not a de Polignac number, because 10210102022213 - 28 = 10210102021957 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10210102022191 and 10210102022200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10210102022243) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5105051011106 + 5105051011107.
It is an arithmetic number, because the mean of its divisors is an integer number (5105051011107).
Almost surely, 210210102022213 is an apocalyptic number.
It is an amenable number.
10210102022213 is a deficient number, since it is larger than the sum of its proper divisors (1).
10210102022213 is an equidigital number, since it uses as much as digits as its factorization.
10210102022213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 10210102022213 its reverse (31222020101201), we get a palindrome (41432122123414).
The spelling of 10210102022213 in words is "ten trillion, two hundred ten billion, one hundred two million, twenty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •