Base | Representation |
---|---|
bin | 11110100101110101100… |
… | …111001010110101010001 |
3 | 21102222011210011002211112 |
4 | 132211311213022311101 |
5 | 233420312311210001 |
6 | 4245424251223105 |
7 | 304610530645301 |
oct | 36456547126521 |
9 | 7388153132745 |
10 | 2102212210001 |
11 | 7405a7a96012 |
12 | 29b50a747a95 |
13 | 12331248bbc7 |
14 | 73a67649601 |
15 | 39a3b546cbb |
hex | 1e9759cad51 |
2102212210001 has 4 divisors (see below), whose sum is σ = 2108971735104. Its totient is φ = 2095452684900.
The previous prime is 2102212209997. The next prime is 2102212210027. The reversal of 2102212210001 is 1000122122012.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2102212210001 - 22 = 2102212209997 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2102212213001) 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 3 ways as a sum of consecutive naturals, for example, 3379762085 + ... + 3379762706.
It is an arithmetic number, because the mean of its divisors is an integer number (527242933776).
Almost surely, 22102212210001 is an apocalyptic number.
It is an amenable number.
2102212210001 is a deficient number, since it is larger than the sum of its proper divisors (6759525103).
2102212210001 is an equidigital number, since it uses as much as digits as its factorization.
2102212210001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6759525102.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 2102212210001 its reverse (1000122122012), we get a palindrome (3102334332013).
The spelling of 2102212210001 in words is "two trillion, one hundred two billion, two hundred twelve million, two hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •