Base | Representation |
---|---|
bin | 11110100101110101100… |
… | …110011100101100011101 |
3 | 21102222011202210111121021 |
4 | 132211311212130230131 |
5 | 233420312234133041 |
6 | 4245424243204141 |
7 | 304610526230320 |
oct | 36456546345435 |
9 | 7388152714537 |
10 | 2102212021021 |
11 | 7405a7977032 |
12 | 29b50a676651 |
13 | 123312423b98 |
14 | 73a675da7b7 |
15 | 39a3b50acd1 |
hex | 1e97599cb1d |
2102212021021 has 8 divisors (see below), whose sum is σ = 2402612055680. Its totient is φ = 1801832994288.
The previous prime is 2102212021009. The next prime is 2102212021061. The reversal of 2102212021021 is 1201202122012.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2102212021021 - 27 = 2102212020893 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2102212020986 and 2102212021004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2102212021001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5036961 + ... + 5438326.
It is an arithmetic number, because the mean of its divisors is an integer number (300326506960).
Almost surely, 22102212021021 is an apocalyptic number.
It is an amenable number.
2102212021021 is a deficient number, since it is larger than the sum of its proper divisors (300400034659).
2102212021021 is a wasteful number, since it uses less digits than its factorization.
2102212021021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10503963.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 2102212021021 its reverse (1201202122012), we get a palindrome (3303414143033).
The spelling of 2102212021021 in words is "two trillion, one hundred two billion, two hundred twelve million, twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •