Base | Representation |
---|---|
bin | 11101000110101111010… |
… | …100001100110111011101 |
3 | 21002012121111002022111100 |
4 | 131012233110030313131 |
5 | 230232201340213041 |
6 | 4130500031543313 |
7 | 264334240564152 |
oct | 35065724146735 |
9 | 7065544068440 |
10 | 2000101101021 |
11 | 701268a24551 |
12 | 28377198ab39 |
13 | 1167bb4a206a |
14 | 6cb3c08a229 |
15 | 37061ced6b6 |
hex | 1d1af50cddd |
2000101101021 has 12 divisors (see below), whose sum is σ = 2889599365120. Its totient is φ = 1333140222600.
The previous prime is 2000101100993. The next prime is 2000101101023. The reversal of 2000101101021 is 1201011010002.
It is a happy number.
It is not a de Polignac number, because 2000101101021 - 235 = 1965741362653 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2000101100994 and 2000101101012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2000101101023) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 21660655 + ... + 21752796.
Almost surely, 22000101101021 is an apocalyptic number.
It is an amenable number.
2000101101021 is a deficient number, since it is larger than the sum of its proper divisors (889498264099).
2000101101021 is a wasteful number, since it uses less digits than its factorization.
2000101101021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 43418576 (or 43418573 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 2000101101021 its reverse (1201011010002), we get a palindrome (3201112111023).
It can be divided in two parts, 200010 and 1101021, that added together give a palindrome (1301031).
The spelling of 2000101101021 in words is "two trillion, one hundred one million, one hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •