Base | Representation |
---|---|
bin | 1001001011111010001011… |
… | …0110000101101111111101 |
3 | 1022202120101022120212111211 |
4 | 2102332202312011233331 |
5 | 2310440202222414323 |
6 | 33251545023044421 |
7 | 2061500243115643 |
oct | 222764266055775 |
9 | 38676338525454 |
10 | 10100200201213 |
11 | 324451a77a271 |
12 | 11715a0740711 |
13 | 5835a2292a05 |
14 | 26cbd09c5193 |
15 | 127ae1a2670d |
hex | 92fa2d85bfd |
10100200201213 has 2 divisors, whose sum is σ = 10100200201214. Its totient is φ = 10100200201212.
The previous prime is 10100200201207. The next prime is 10100200201253. The reversal of 10100200201213 is 31210200200101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7665267778884 + 2434932422329 = 2768622^2 + 1560427^2 .
It is a cyclic number.
It is not a de Polignac number, because 10100200201213 - 217 = 10100200070141 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10100200201193 and 10100200201202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10100200201253) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050100100606 + 5050100100607.
It is an arithmetic number, because the mean of its divisors is an integer number (5050100100607).
Almost surely, 210100200201213 is an apocalyptic number.
It is an amenable number.
10100200201213 is a deficient number, since it is larger than the sum of its proper divisors (1).
10100200201213 is an equidigital number, since it uses as much as digits as its factorization.
10100200201213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 10100200201213 its reverse (31210200200101), we get a palindrome (41310400401314).
The spelling of 10100200201213 in words is "ten trillion, one hundred billion, two hundred million, two hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •