Base | Representation |
---|---|
bin | 10010110100000010… |
… | …01111101000100101 |
3 | 222001220022211200202 |
4 | 21122001033220211 |
5 | 131141123211323 |
6 | 4350122320245 |
7 | 505202241002 |
oct | 113201175045 |
9 | 28056284622 |
10 | 10100210213 |
11 | 431333a475 |
12 | 1b5a659085 |
13 | c4c6a5862 |
14 | 6bb5aa8a9 |
15 | 3e1aa4d28 |
hex | 25a04fa25 |
10100210213 has 2 divisors, whose sum is σ = 10100210214. Its totient is φ = 10100210212.
The previous prime is 10100210173. The next prime is 10100210233. The reversal of 10100210213 is 31201200101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9888711364 + 211498849 = 99442^2 + 14543^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10100210213 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10100210194 and 10100210203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10100210233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050105106 + 5050105107.
It is an arithmetic number, because the mean of its divisors is an integer number (5050105107).
Almost surely, 210100210213 is an apocalyptic number.
It is an amenable number.
10100210213 is a deficient number, since it is larger than the sum of its proper divisors (1).
10100210213 is an equidigital number, since it uses as much as digits as its factorization.
10100210213 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 11.
Adding to 10100210213 its reverse (31201200101), we get a palindrome (41301410314).
The spelling of 10100210213 in words is "ten billion, one hundred million, two hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •