Base | Representation |
---|---|
bin | 11101000110101011001… |
… | …101010111100110001101 |
3 | 21002012102200102211120110 |
4 | 131012223031113212031 |
5 | 230232031220413401 |
6 | 4130445131110233 |
7 | 264332443131564 |
oct | 35065315274615 |
9 | 7065380384513 |
10 | 2000032201101 |
11 | 701233044a70 |
12 | 2837528a2379 |
13 | 1167aa12a18c |
14 | 6cb32c72bdb |
15 | 3705ac3d9d6 |
hex | 1d1ab35798d |
2000032201101 has 32 divisors (see below), whose sum is σ = 3036946203648. Its totient is φ = 1158933184640.
The previous prime is 2000032201043. The next prime is 2000032201109. The reversal of 2000032201101 is 1011022300002.
It is not a de Polignac number, because 2000032201101 - 227 = 1999897983373 is a prime.
It is a super-2 number, since 2×20000322011012 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2000032201109) 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 31 ways as a sum of consecutive naturals, for example, 1169830 + ... + 2317016.
It is an arithmetic number, because the mean of its divisors is an integer number (94904568864).
Almost surely, 22000032201101 is an apocalyptic number.
It is an amenable number.
2000032201101 is a deficient number, since it is larger than the sum of its proper divisors (1036914002547).
2000032201101 is a wasteful number, since it uses less digits than its factorization.
2000032201101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1149521.
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 2000032201101 its reverse (1011022300002), we get a palindrome (3011054501103).
The spelling of 2000032201101 in words is "two trillion, thirty-two million, two hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •