Base | Representation |
---|---|
bin | 1001001001111010110101… |
… | …00111111000110111010001 |
3 | 2122021121021221012021001020 |
4 | 10210331122213320313101 |
5 | 10114320400210403241 |
6 | 110452310004430053 |
7 | 4145330344366050 |
oct | 444753247706721 |
9 | 78247257167036 |
10 | 20132032122321 |
11 | 6461a463237a9 |
12 | 23118809a8329 |
13 | b3059a19b8c2 |
14 | 4d8577584397 |
15 | 24da31304b66 |
hex | 124f5a9f8dd1 |
20132032122321 has 16 divisors (see below), whose sum is σ = 30677608356864. Its totient is φ = 11503933577424.
The previous prime is 20132032122299. The next prime is 20132032122337. The reversal of 20132032122321 is 12322123023102.
It is not a de Polignac number, because 20132032122321 - 218 = 20132031860177 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20132032122291 and 20132032122300.
It is not an unprimeable number, because it can be changed into a prime (20132032122121) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 556675 + ... + 6369768.
It is an arithmetic number, because the mean of its divisors is an integer number (1917350522304).
Almost surely, 220132032122321 is an apocalyptic number.
20132032122321 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
20132032122321 is a deficient number, since it is larger than the sum of its proper divisors (10545576234543).
20132032122321 is a wasteful number, since it uses less digits than its factorization.
20132032122321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7064860.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 20132032122321 its reverse (12322123023102), we get a palindrome (32454155145423).
The spelling of 20132032122321 in words is "twenty trillion, one hundred thirty-two billion, thirty-two million, one hundred twenty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •