Base | Representation |
---|---|
bin | 11101011001010001100… |
… | …100110011100100100001 |
3 | 21011002222111110022201202 |
4 | 131121101210303210201 |
5 | 231043431311411113 |
6 | 4143550543410545 |
7 | 265640364112553 |
oct | 35312144634441 |
9 | 7132874408652 |
10 | 2020003232033 |
11 | 709751188106 |
12 | 2875a6bb3a55 |
13 | 118640801147 |
14 | 6daa93774d3 |
15 | 37829186258 |
hex | 1d651933921 |
2020003232033 has 8 divisors (see below), whose sum is σ = 2069293180416. Its totient is φ = 1970714311200.
The previous prime is 2020003232029. The next prime is 2020003232041. The reversal of 2020003232033 is 3302323000202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2020003232033 - 22 = 2020003232029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2020003231996 and 2020003232014.
It is not an unprimeable number, because it can be changed into a prime (2020003231033) 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 7 ways as a sum of consecutive naturals, for example, 5038160 + ... + 5424302.
It is an arithmetic number, because the mean of its divisors is an integer number (258661647552).
Almost surely, 22020003232033 is an apocalyptic number.
It is an amenable number.
2020003232033 is a deficient number, since it is larger than the sum of its proper divisors (49289948383).
2020003232033 is a wasteful number, since it uses less digits than its factorization.
2020003232033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 513775.
The product of its (nonzero) digits is 1296, while the sum is 20.
Adding to 2020003232033 its reverse (3302323000202), we get a palindrome (5322326232235).
The spelling of 2020003232033 in words is "two trillion, twenty billion, three million, two hundred thirty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •