Base | Representation |
---|---|
bin | 1001010010111100111110… |
… | …0110010010111110110001 |
3 | 1100012010201201002200021222 |
4 | 2110233033212102332301 |
5 | 2314431014242320423 |
6 | 33423320433354425 |
7 | 2103313054343216 |
oct | 224571746227661 |
9 | 40163651080258 |
10 | 10221210120113 |
11 | 3290877712403 |
12 | 1190b32708a15 |
13 | 591b1877ac15 |
14 | 2749d00dbb0d |
15 | 12ad254bc3c8 |
hex | 94bcf992fb1 |
10221210120113 has 2 divisors, whose sum is σ = 10221210120114. Its totient is φ = 10221210120112.
The previous prime is 10221210120073. The next prime is 10221210120217. The reversal of 10221210120113 is 31102101212201.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10206600079729 + 14610040384 = 3194777^2 + 120872^2 .
It is a cyclic number.
It is not a de Polignac number, because 10221210120113 - 222 = 10221205925809 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10221210120091 and 10221210120100.
It is not a weakly prime, because it can be changed into another prime (10221210120013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5110605060056 + 5110605060057.
It is an arithmetic number, because the mean of its divisors is an integer number (5110605060057).
Almost surely, 210221210120113 is an apocalyptic number.
It is an amenable number.
10221210120113 is a deficient number, since it is larger than the sum of its proper divisors (1).
10221210120113 is an equidigital number, since it uses as much as digits as its factorization.
10221210120113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 10221210120113 its reverse (31102101212201), we get a palindrome (41323311332314).
The spelling of 10221210120113 in words is "ten trillion, two hundred twenty-one billion, two hundred ten million, one hundred twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •