Base | Representation |
---|---|
bin | 11101000111100110001… |
… | …101001100001011110101 |
3 | 21002021222122221100021001 |
4 | 131013212031030023311 |
5 | 230241043113310401 |
6 | 4131131250123301 |
7 | 264366122306242 |
oct | 35074615141365 |
9 | 7067878840231 |
10 | 2001022010101 |
11 | 7016a0838134 |
12 | 28398a280531 |
13 | 11690720988a |
14 | 6cbc84ca5c9 |
15 | 370b7aaa601 |
hex | 1d1e634c2f5 |
2001022010101 has 4 divisors (see below), whose sum is σ = 2070022769100. Its totient is φ = 1932021251104.
The previous prime is 2001022010087. The next prime is 2001022010129. The reversal of 2001022010101 is 1010102201002.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 740634081201 + 1260387928900 = 860601^2 + 1122670^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2001022010101 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2001022013101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 34500379456 + ... + 34500379513.
It is an arithmetic number, because the mean of its divisors is an integer number (517505692275).
Almost surely, 22001022010101 is an apocalyptic number.
It is an amenable number.
2001022010101 is a deficient number, since it is larger than the sum of its proper divisors (69000758999).
2001022010101 is an equidigital number, since it uses as much as digits as its factorization.
2001022010101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 69000758998.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 2001022010101 its reverse (1010102201002), we get a palindrome (3011124211103).
The spelling of 2001022010101 in words is "two trillion, one billion, twenty-two million, ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •