Base | Representation |
---|---|
bin | 11110001101000011010110… |
… | …110010101011011101101111 |
3 | 122102100020000011022110110110 |
4 | 132031003112302223131233 |
5 | 114402410421121441033 |
6 | 1150305032502511103 |
7 | 36660153125630316 |
oct | 3615032662533557 |
9 | 572306004273413 |
10 | 132838352140143 |
11 | 393654797702a1 |
12 | 12a94b67435493 |
13 | 59177ab626470 |
14 | 24b35a678d27d |
15 | 105566c84a363 |
hex | 78d0d6cab76f |
132838352140143 has 32 divisors (see below), whose sum is σ = 197109476085760. Its totient is φ = 79023605598720.
The previous prime is 132838352140141. The next prime is 132838352140181. The reversal of 132838352140143 is 341041253838231.
It is not a de Polignac number, because 132838352140143 - 21 = 132838352140141 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132838352140092 and 132838352140101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132838352140141) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 58668346 + ... + 60890487.
It is an arithmetic number, because the mean of its divisors is an integer number (6159671127680).
Almost surely, 2132838352140143 is an apocalyptic number.
132838352140143 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
132838352140143 is a deficient number, since it is larger than the sum of its proper divisors (64271123945617).
132838352140143 is a wasteful number, since it uses less digits than its factorization.
132838352140143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 119559799.
The product of its (nonzero) digits is 1658880, while the sum is 48.
The spelling of 132838352140143 in words is "one hundred thirty-two trillion, eight hundred thirty-eight billion, three hundred fifty-two million, one hundred forty thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •