Base | Representation |
---|---|
bin | 1001001111011110111110… |
… | …00010110000101001111001 |
3 | 2122221212211000002200021122 |
4 | 10213233133002300221321 |
5 | 10130433434433220441 |
6 | 111120210344315025 |
7 | 4165206433302053 |
oct | 447573702605171 |
9 | 78855730080248 |
10 | 20323232320121 |
11 | 65260419012a5 |
12 | 2342941472a75 |
13 | b4561b363b13 |
14 | 503914a848d3 |
15 | 2539c1e4534b |
hex | 127bdf0b0a79 |
20323232320121 has 8 divisors (see below), whose sum is σ = 21206997599424. Its totient is φ = 19439479247760.
The previous prime is 20323232320109. The next prime is 20323232320169. The reversal of 20323232320121 is 12102323232302.
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 20323232320121 - 210 = 20323232319097 is a prime.
It is a super-2 number, since 2×203232323201212 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (20323232328121) 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, 435230 + ... + 6390296.
It is an arithmetic number, because the mean of its divisors is an integer number (2650874699928).
Almost surely, 220323232320121 is an apocalyptic number.
It is an amenable number.
20323232320121 is a deficient number, since it is larger than the sum of its proper divisors (883765279303).
20323232320121 is a wasteful number, since it uses less digits than its factorization.
20323232320121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6103471.
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 20323232320121 its reverse (12102323232302), we get a palindrome (32425555552423).
The spelling of 20323232320121 in words is "twenty trillion, three hundred twenty-three billion, two hundred thirty-two million, three hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •