Base | Representation |
---|---|
bin | 1110100111001010100010… |
… | …00111101001100111011101 |
3 | 11012202210100010002112211021 |
4 | 13103211101013221213131 |
5 | 13202422324343120331 |
6 | 152201124152324141 |
7 | 6524314123423030 |
oct | 723452107514735 |
9 | 135683303075737 |
10 | 32132011301341 |
11 | a269122777486 |
12 | 372b4956a3651 |
13 | 14c106047b483 |
14 | 7d12aa4a3017 |
15 | 3aac624b1211 |
hex | 1d39511e99dd |
32132011301341 has 4 divisors (see below), whose sum is σ = 36722298630112. Its totient is φ = 27541723972572.
The previous prime is 32132011301339. The next prime is 32132011301359. The reversal of 32132011301341 is 14310311023123.
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 32132011301341 - 21 = 32132011301339 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 (32132011301371) 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, 2295143664375 + ... + 2295143664388.
It is an arithmetic number, because the mean of its divisors is an integer number (9180574657528).
Almost surely, 232132011301341 is an apocalyptic number.
It is an amenable number.
32132011301341 is a deficient number, since it is larger than the sum of its proper divisors (4590287328771).
32132011301341 is an equidigital number, since it uses as much as digits as its factorization.
32132011301341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4590287328770.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 32132011301341 its reverse (14310311023123), we get a palindrome (46442322324464).
The spelling of 32132011301341 in words is "thirty-two trillion, one hundred thirty-two billion, eleven million, three hundred one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •