Base | Representation |
---|---|
bin | 11110000101100110101010… |
… | …010110011111001110011101 |
3 | 122100112021211200110020120111 |
4 | 132011212222112133032131 |
5 | 114321014140343204003 |
6 | 1145233542443450021 |
7 | 36605163106534651 |
oct | 3605465226371635 |
9 | 570467750406514 |
10 | 132326505444253 |
11 | 391883a063a93a |
12 | 12a1191ab26911 |
13 | 58ab44a02b983 |
14 | 24968cc056a61 |
15 | 10471b1b79e6d |
hex | 7859aa59f39d |
132326505444253 has 8 divisors (see below), whose sum is σ = 132335589900800. Its totient is φ = 132317421339600.
The previous prime is 132326505444251. The next prime is 132326505444323. The reversal of 132326505444253 is 352444505623231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 132326505444253 - 21 = 132326505444251 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132326505444197 and 132326505444206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132326505444251) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1393581928 + ... + 1393676878.
It is an arithmetic number, because the mean of its divisors is an integer number (16541948737600).
Almost surely, 2132326505444253 is an apocalyptic number.
It is an amenable number.
132326505444253 is a deficient number, since it is larger than the sum of its proper divisors (9084456547).
132326505444253 is an equidigital number, since it uses as much as digits as its factorization.
132326505444253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 175947.
The product of its (nonzero) digits is 10368000, while the sum is 49.
The spelling of 132326505444253 in words is "one hundred thirty-two trillion, three hundred twenty-six billion, five hundred five million, four hundred forty-four thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •