Base | Representation |
---|---|
bin | 1110100110100101011101… |
… | …00100001000111101000101 |
3 | 11012200212221202101202020202 |
4 | 13103102232210020331011 |
5 | 13202111042134324331 |
6 | 152144032542340245 |
7 | 6523010610113354 |
oct | 723225644107505 |
9 | 135625852352222 |
10 | 32112104214341 |
11 | a260737739368 |
12 | 372765a88a685 |
13 | 14bc20a105658 |
14 | 7d033c68599b |
15 | 3aa499999ecb |
hex | 1d34ae908f45 |
32112104214341 has 4 divisors (see below), whose sum is σ = 32112619728000. Its totient is φ = 32111588700684.
The previous prime is 32112104214271. The next prime is 32112104214347. The reversal of 32112104214341 is 14341240121123.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 32112104214341 - 222 = 32112100020037 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32112104214347) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 257663381 + ... + 257787978.
It is an arithmetic number, because the mean of its divisors is an integer number (8028154932000).
Almost surely, 232112104214341 is an apocalyptic number.
It is an amenable number.
32112104214341 is a deficient number, since it is larger than the sum of its proper divisors (515513659).
32112104214341 is an equidigital number, since it uses as much as digits as its factorization.
32112104214341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 515513658.
The product of its (nonzero) digits is 4608, while the sum is 29.
Adding to 32112104214341 its reverse (14341240121123), we get a palindrome (46453344335464).
The spelling of 32112104214341 in words is "thirty-two trillion, one hundred twelve billion, one hundred four million, two hundred fourteen thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •