Base | Representation |
---|---|
bin | 11101000111101010111… |
… | …110110010110000100101 |
3 | 21002022012020200110011012 |
4 | 131013222332302300211 |
5 | 230241224120401041 |
6 | 4131143231152005 |
7 | 264401114246552 |
oct | 35075276626045 |
9 | 7068166613135 |
10 | 2001102122021 |
11 | 701731a85432 |
12 | 2839b1075605 |
13 | 11691a9a8b92 |
14 | 6cbd4dc1a29 |
15 | 370beb323eb |
hex | 1d1eafb2c25 |
2001102122021 has 16 divisors (see below), whose sum is σ = 2108661465600. Its totient is φ = 1896221103168.
The previous prime is 2001102121999. The next prime is 2001102122029. The reversal of 2001102122021 is 1202212011002.
It is not a de Polignac number, because 2001102122021 - 226 = 2001035013157 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2001102121987 and 2001102122005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2001102122029) 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 15 ways as a sum of consecutive naturals, for example, 75191 + ... + 2001963.
It is an arithmetic number, because the mean of its divisors is an integer number (131791341600).
Almost surely, 22001102122021 is an apocalyptic number.
It is an amenable number.
2001102122021 is a deficient number, since it is larger than the sum of its proper divisors (107559343579).
2001102122021 is a wasteful number, since it uses less digits than its factorization.
2001102122021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1927468.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 2001102122021 its reverse (1202212011002), we get a palindrome (3203314133023).
The spelling of 2001102122021 in words is "two trillion, one billion, one hundred two million, one hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •