Base | Representation |
---|---|
bin | 11101101101111100100… |
… | …11110000111001011101 |
3 | 10121121122012222121220011 |
4 | 32312332103300321131 |
5 | 113212203111214323 |
6 | 2101030434523221 |
7 | 133525545440053 |
oct | 16667623607135 |
9 | 3547565877804 |
10 | 1021100101213 |
11 | 364056429275 |
12 | 145a90436511 |
13 | 7539b85b22a |
14 | 375c88961d3 |
15 | 1b863d8820d |
hex | edbe4f0e5d |
1021100101213 has 2 divisors, whose sum is σ = 1021100101214. Its totient is φ = 1021100101212.
The previous prime is 1021100101201. The next prime is 1021100101247. The reversal of 1021100101213 is 3121010011201.
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., 643905138969 + 377194962244 = 802437^2 + 614162^2 .
It is a cyclic number.
It is not a de Polignac number, because 1021100101213 - 233 = 1012510166621 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1021100101193 and 1021100101202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1021100101253) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 510550050606 + 510550050607.
It is an arithmetic number, because the mean of its divisors is an integer number (510550050607).
Almost surely, 21021100101213 is an apocalyptic number.
It is an amenable number.
1021100101213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1021100101213 is an equidigital number, since it uses as much as digits as its factorization.
1021100101213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 1021100101213 its reverse (3121010011201), we get a palindrome (4142110112414).
The spelling of 1021100101213 in words is "one trillion, twenty-one billion, one hundred million, one hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •