Base | Representation |
---|---|
bin | 1001000110101010111100… |
… | …1000011000110011010101 |
3 | 1022102222002212221011200012 |
4 | 2101222233020120303111 |
5 | 2303001403233324341 |
6 | 33142343343530005 |
7 | 2052133246120622 |
oct | 221525710306325 |
9 | 38388085834605 |
10 | 10010212011221 |
11 | 320a341795214 |
12 | 11580678b9905 |
13 | 577c60a47106 |
14 | 2686d54bd349 |
15 | 1255c672e0eb |
hex | 91aaf218cd5 |
10010212011221 has 2 divisors, whose sum is σ = 10010212011222. Its totient is φ = 10010212011220.
The previous prime is 10010212011211. The next prime is 10010212011251. The reversal of 10010212011221 is 12211021201001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9916900090321 + 93311920900 = 3149111^2 + 305470^2 .
It is a cyclic number.
It is not a de Polignac number, because 10010212011221 - 218 = 10010211749077 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10010212011196 and 10010212011205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10010212011211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5005106005610 + 5005106005611.
It is an arithmetic number, because the mean of its divisors is an integer number (5005106005611).
Almost surely, 210010212011221 is an apocalyptic number.
It is an amenable number.
10010212011221 is a deficient number, since it is larger than the sum of its proper divisors (1).
10010212011221 is an equidigital number, since it uses as much as digits as its factorization.
10010212011221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 10010212011221 its reverse (12211021201001), we get a palindrome (22221233212222).
The spelling of 10010212011221 in words is "ten trillion, ten billion, two hundred twelve million, eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •