Base | Representation |
---|---|
bin | 1001000111000001000110… |
… | …10100110101011110001001 |
3 | 2121221001220211111101011202 |
4 | 10203200203110311132021 |
5 | 10111202142423224001 |
6 | 110334415410433545 |
7 | 4135200365433611 |
oct | 443404324653611 |
9 | 77831824441152 |
10 | 20032320133001 |
11 | 6423728523360 |
12 | 22b64935928b5 |
13 | b2406924caa7 |
14 | 4d37d8895a41 |
15 | 24b14750b96b |
hex | 123823535789 |
20032320133001 has 8 divisors (see below), whose sum is σ = 23003621205600. Its totient is φ = 17252715903840.
The previous prime is 20032320132991. The next prime is 20032320133009. The reversal of 20032320133001 is 10033102323002.
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 20032320133001 - 214 = 20032320116617 is a prime.
It is a super-2 number, since 2×200323201330012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20032320133009) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 47924210636 + ... + 47924211053.
It is an arithmetic number, because the mean of its divisors is an integer number (2875452650700).
Almost surely, 220032320133001 is an apocalyptic number.
It is an amenable number.
20032320133001 is a deficient number, since it is larger than the sum of its proper divisors (2971301072599).
20032320133001 is a wasteful number, since it uses less digits than its factorization.
20032320133001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 95848421719.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 20032320133001 its reverse (10033102323002), we get a palindrome (30065422456003).
The spelling of 20032320133001 in words is "twenty trillion, thirty-two billion, three hundred twenty million, one hundred thirty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •