Base | Representation |
---|---|
bin | 11110100100110100000… |
… | …010010010000011011101 |
3 | 21102212100002221201112122 |
4 | 132210310002102003131 |
5 | 233411034134134323 |
6 | 4245123150312325 |
7 | 304541341334642 |
oct | 36446402220335 |
9 | 7385302851478 |
10 | 2101112021213 |
11 | 740092a61987 |
12 | 29b2621b86a5 |
13 | 12319857331a |
14 | 739a149bdc9 |
15 | 399c4b74ec8 |
hex | 1e9340920dd |
2101112021213 has 2 divisors, whose sum is σ = 2101112021214. Its totient is φ = 2101112021212.
The previous prime is 2101112021159. The next prime is 2101112021249. The reversal of 2101112021213 is 3121202111012.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1787962099609 + 313149921604 = 1337147^2 + 559598^2 .
It is a cyclic number.
It is not a de Polignac number, because 2101112021213 - 230 = 2100038279389 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2101112021191 and 2101112021200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2101112021273) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1050556010606 + 1050556010607.
It is an arithmetic number, because the mean of its divisors is an integer number (1050556010607).
Almost surely, 22101112021213 is an apocalyptic number.
It is an amenable number.
2101112021213 is a deficient number, since it is larger than the sum of its proper divisors (1).
2101112021213 is an equidigital number, since it uses as much as digits as its factorization.
2101112021213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 2101112021213 its reverse (3121202111012), we get a palindrome (5222314132225).
The spelling of 2101112021213 in words is "two trillion, one hundred one billion, one hundred twelve million, twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •