Base | Representation |
---|---|
bin | 11101000111111000101… |
… | …011110000000000001101 |
3 | 21002022210021021000120121 |
4 | 131013320223300000031 |
5 | 230242211443323041 |
6 | 4131222122344541 |
7 | 264406605261100 |
oct | 35077053600015 |
9 | 7068707230517 |
10 | 2001332011021 |
11 | 70183a822442 |
12 | 283a5605b151 |
13 | 1169564c9785 |
14 | 6cc17744737 |
15 | 370d4de27d1 |
hex | 1d1f8af000d |
2001332011021 has 24 divisors (see below), whose sum is σ = 2477413252800. Its totient is φ = 1606406643072.
The previous prime is 2001332010983. The next prime is 2001332011027. The reversal of 2001332011021 is 1201102331002.
It is not a de Polignac number, because 2001332011021 - 229 = 2000795140109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2001332010986 and 2001332011004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2001332011027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5870815 + ... + 6202348.
It is an arithmetic number, because the mean of its divisors is an integer number (103225552200).
Almost surely, 22001332011021 is an apocalyptic number.
It is an amenable number.
2001332011021 is a deficient number, since it is larger than the sum of its proper divisors (476081241779).
2001332011021 is a wasteful number, since it uses less digits than its factorization.
2001332011021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12073393 (or 12073386 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 2001332011021 its reverse (1201102331002), we get a palindrome (3202434342023).
The spelling of 2001332011021 in words is "two trillion, one billion, three hundred thirty-two million, eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •