Base | Representation |
---|---|
bin | 11110100100111001111… |
… | …000000111100101110101 |
3 | 21102212120221100120220020 |
4 | 132210321320013211311 |
5 | 233411234231121323 |
6 | 4245141010555353 |
7 | 304543641324213 |
oct | 36447170074565 |
9 | 7385527316806 |
10 | 2101210020213 |
11 | 740133306a97 |
12 | 29b28ab98b59 |
13 | 1231b29660b5 |
14 | 739b04cbcb3 |
15 | 399cd581ae3 |
hex | 1e939e07975 |
2101210020213 has 8 divisors (see below), whose sum is σ = 2807319295776. Its totient is φ = 1397953712400.
The previous prime is 2101210020209. The next prime is 2101210020227. The reversal of 2101210020213 is 3120200121012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2101210020213 - 22 = 2101210020209 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2101210020192 and 2101210020201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2101210020113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 713240218 + ... + 713243163.
It is an arithmetic number, because the mean of its divisors is an integer number (350914911972).
Almost surely, 22101210020213 is an apocalyptic number.
It is an amenable number.
2101210020213 is a deficient number, since it is larger than the sum of its proper divisors (706109275563).
2101210020213 is a wasteful number, since it uses less digits than its factorization.
2101210020213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1426483875.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 2101210020213 its reverse (3120200121012), we get a palindrome (5221410141225).
The spelling of 2101210020213 in words is "two trillion, one hundred one billion, two hundred ten million, twenty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •