Base | Representation |
---|---|
bin | 1001010010111100001110… |
… | …1111100001011110110101 |
3 | 1100012010012211211002221201 |
4 | 2110233003233201132311 |
5 | 2314430112332242323 |
6 | 33423245010212501 |
7 | 2103305120554624 |
oct | 224570357413665 |
9 | 40163184732851 |
10 | 10221011212213 |
11 | 3290785405a0a |
12 | 1190a97b84131 |
13 | 591ab64b6a39 |
14 | 2749b19216bb |
15 | 12ad12ccb8ad |
hex | 94bc3be17b5 |
10221011212213 has 2 divisors, whose sum is σ = 10221011212214. Its totient is φ = 10221011212212.
The previous prime is 10221011212199. The next prime is 10221011212403. The reversal of 10221011212213 is 31221211012201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9260536730769 + 960474481444 = 3043113^2 + 980038^2 .
It is a cyclic number.
It is not a de Polignac number, because 10221011212213 - 213 = 10221011204021 is a prime.
It is a super-3 number, since 3×102210112122133 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10221011212513) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5110505606106 + 5110505606107.
It is an arithmetic number, because the mean of its divisors is an integer number (5110505606107).
Almost surely, 210221011212213 is an apocalyptic number.
It is an amenable number.
10221011212213 is a deficient number, since it is larger than the sum of its proper divisors (1).
10221011212213 is an equidigital number, since it uses as much as digits as its factorization.
10221011212213 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 19.
Adding to 10221011212213 its reverse (31221211012201), we get a palindrome (41442222224414).
The spelling of 10221011212213 in words is "ten trillion, two hundred twenty-one billion, eleven million, two hundred twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •