Base | Representation |
---|---|
bin | 1001000111000010100110… |
… | …00101001000000010010111 |
3 | 2121221010222200001221122110 |
4 | 10203201103011020002113 |
5 | 10111210313024233421 |
6 | 110335031111002103 |
7 | 4135226264426163 |
oct | 443412305100227 |
9 | 77833880057573 |
10 | 20033121321111 |
11 | 6423aa97a5898 |
12 | 22b6677969333 |
13 | b2416622a6b2 |
14 | 4d387304dca3 |
15 | 24b192a1aa76 |
hex | 123853148097 |
20033121321111 has 8 divisors (see below), whose sum is σ = 27010950096240. Its totient is φ = 13205353380032.
The previous prime is 20033121321077. The next prime is 20033121321119. The reversal of 20033121321111 is 11112312133002.
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 20033121321111 - 27 = 20033121320983 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20033121321119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 37515208200 + ... + 37515208733.
It is an arithmetic number, because the mean of its divisors is an integer number (3376368762030).
Almost surely, 220033121321111 is an apocalyptic number.
20033121321111 is a deficient number, since it is larger than the sum of its proper divisors (6977828775129).
20033121321111 is an equidigital number, since it uses as much as digits as its factorization.
20033121321111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75030417025.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 20033121321111 its reverse (11112312133002), we get a palindrome (31145433454113).
The spelling of 20033121321111 in words is "twenty trillion, thirty-three billion, one hundred twenty-one million, three hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •