Base | Representation |
---|---|
bin | 111101100110111110… |
… | …1000101111011011111 |
3 | 110122111112000000201011 |
4 | 1323031331011323133 |
5 | 4131424404110411 |
6 | 140440233400051 |
7 | 12362424350335 |
oct | 1731575057337 |
9 | 418445000634 |
10 | 132304363231 |
11 | 51123400357 |
12 | 21784569027 |
13 | c626416981 |
14 | 6591551b55 |
15 | 36952e7c21 |
hex | 1ecdf45edf |
132304363231 has 8 divisors (see below), whose sum is σ = 133819646400. Its totient is φ = 130789718400.
The previous prime is 132304363229. The next prime is 132304363271. The reversal of 132304363231 is 132363403231.
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 132304363231 - 21 = 132304363229 is a prime.
It is a super-2 number, since 2×1323043632312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132304363193 and 132304363202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132304363271) 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, 263706 + ... + 578056.
It is an arithmetic number, because the mean of its divisors is an integer number (16727455800).
Almost surely, 2132304363231 is an apocalyptic number.
132304363231 is a deficient number, since it is larger than the sum of its proper divisors (1515283169).
132304363231 is an equidigital number, since it uses as much as digits as its factorization.
132304363231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 319169.
The product of its (nonzero) digits is 23328, while the sum is 31.
Adding to 132304363231 its reverse (132363403231), we get a palindrome (264667766462).
The spelling of 132304363231 in words is "one hundred thirty-two billion, three hundred four million, three hundred sixty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •