Base | Representation |
---|---|
bin | 1110100110100001110000… |
… | …10100100000000010110001 |
3 | 11012200200211111111200212010 |
4 | 13103100320110200002301 |
5 | 13202043011310344441 |
6 | 152143104034353133 |
7 | 6522610501025235 |
oct | 723207024400261 |
9 | 135620744450763 |
10 | 32110120403121 |
11 | a25a909949662 |
12 | 37271a642b7a9 |
13 | 14bbc82108a67 |
14 | 7d01d10025c5 |
15 | 3aa3d0734116 |
hex | 1d34385200b1 |
32110120403121 has 8 divisors (see below), whose sum is σ = 42814255373440. Its totient is φ = 21406366184112.
The previous prime is 32110120403107. The next prime is 32110120403131. The reversal of 32110120403121 is 12130402101123.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 32110120403121 - 217 = 32110120272049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (32110120403131) 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, 94990990 + ... + 95328423.
It is an arithmetic number, because the mean of its divisors is an integer number (5351781921680).
Almost surely, 232110120403121 is an apocalyptic number.
It is an amenable number.
32110120403121 is a deficient number, since it is larger than the sum of its proper divisors (10704134970319).
32110120403121 is a wasteful number, since it uses less digits than its factorization.
32110120403121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 190375655.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 32110120403121 its reverse (12130402101123), we get a palindrome (44240522504244).
The spelling of 32110120403121 in words is "thirty-two trillion, one hundred ten billion, one hundred twenty million, four hundred three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •