Base | Representation |
---|---|
bin | 1001001111101111101111… |
… | …00010011001010111011001 |
3 | 2122222202001021211210210022 |
4 | 10213313313202121113121 |
5 | 10131110403144413423 |
6 | 111124255440400225 |
7 | 4165645456442441 |
oct | 447676742312731 |
9 | 78882037753708 |
10 | 20332233201113 |
11 | 6529940644419 |
12 | 2344633916075 |
13 | b464240620c2 |
14 | 50412a249121 |
15 | 253d4c247dc8 |
hex | 127df78995d9 |
20332233201113 has 8 divisors (see below), whose sum is σ = 20610907603968. Its totient is φ = 20053562870304.
The previous prime is 20332233201107. The next prime is 20332233201149. The reversal of 20332233201113 is 31110233223302.
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 20332233201113 - 210 = 20332233200089 is a prime.
It is a super-2 number, since 2×203322332011132 (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 (20332233201913) 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, 9822320 + ... + 11710782.
It is an arithmetic number, because the mean of its divisors is an integer number (2576363450496).
Almost surely, 220332233201113 is an apocalyptic number.
It is an amenable number.
20332233201113 is a deficient number, since it is larger than the sum of its proper divisors (278674402855).
20332233201113 is a wasteful number, since it uses less digits than its factorization.
20332233201113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2036023.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 20332233201113 its reverse (31110233223302), we get a palindrome (51442466424415).
The spelling of 20332233201113 in words is "twenty trillion, three hundred thirty-two billion, two hundred thirty-three million, two hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •