Base | Representation |
---|---|
bin | 1110100111011011101110… |
… | …01110110010111001011011 |
3 | 11012210200011022201200200011 |
4 | 13103231313032302321123 |
5 | 13203100230101040123 |
6 | 152205252045222351 |
7 | 6525061622506111 |
oct | 723556716627133 |
9 | 135720138650604 |
10 | 32141240643163 |
11 | a272029471603 |
12 | 37312305619b7 |
13 | 14c1ba15ba292 |
14 | 7d1904137ab1 |
15 | 3ab102890e0d |
hex | 1d3b773b2e5b |
32141240643163 has 8 divisors (see below), whose sum is σ = 33833346001920. Its totient is φ = 30449181395880.
The previous prime is 32141240643103. The next prime is 32141240643167. The reversal of 32141240643163 is 36134604214123.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-32141240643163 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (32141240643167) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10092523 + ... + 12889588.
It is an arithmetic number, because the mean of its divisors is an integer number (4229168250240).
Almost surely, 232141240643163 is an apocalyptic number.
32141240643163 is a deficient number, since it is larger than the sum of its proper divisors (1692105358757).
32141240643163 is a wasteful number, since it uses less digits than its factorization.
32141240643163 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23055737.
The product of its (nonzero) digits is 248832, while the sum is 40.
Adding to 32141240643163 its reverse (36134604214123), we get a palindrome (68275844857286).
The spelling of 32141240643163 in words is "thirty-two trillion, one hundred forty-one billion, two hundred forty million, six hundred forty-three thousand, one hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •