Base | Representation |
---|---|
bin | 111101100110111111… |
… | …0001010100100000001 |
3 | 110122111112112022100002 |
4 | 1323031332022210001 |
5 | 4131424442104403 |
6 | 140440243405345 |
7 | 12362426631050 |
oct | 1731576124401 |
9 | 418445468302 |
10 | 132304644353 |
11 | 51123582592 |
12 | 21784683855 |
13 | c6264b490b |
14 | 65915c6397 |
15 | 3695351188 |
hex | 1ecdf8a901 |
132304644353 has 4 divisors (see below), whose sum is σ = 151205307840. Its totient is φ = 113403980868.
The previous prime is 132304644349. The next prime is 132304644359. The reversal of 132304644353 is 353446403231.
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, and also an emirpimes, since its reverse is a distinct semiprime: 353446403231 = 389 ⋅908602579.
It is a cyclic number.
It is not a de Polignac number, because 132304644353 - 22 = 132304644349 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132304644359) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9450331733 + ... + 9450331746.
It is an arithmetic number, because the mean of its divisors is an integer number (37801326960).
Almost surely, 2132304644353 is an apocalyptic number.
It is an amenable number.
132304644353 is a deficient number, since it is larger than the sum of its proper divisors (18900663487).
132304644353 is an equidigital number, since it uses as much as digits as its factorization.
132304644353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18900663486.
The product of its (nonzero) digits is 311040, while the sum is 38.
The spelling of 132304644353 in words is "one hundred thirty-two billion, three hundred four million, six hundred forty-four thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •