Base | Representation |
---|---|
bin | 1110110000001110110000… |
… | …01100011101110011010011 |
3 | 11020212120101100111210002202 |
4 | 13120013120030131303103 |
5 | 13223023304333230024 |
6 | 153000202312433415 |
7 | 6555652356334535 |
oct | 730073014356323 |
9 | 136776340453082 |
10 | 32443515133139 |
11 | a379243545890 |
12 | 377b92b6a886b |
13 | 15145446cb936 |
14 | 8023bb387855 |
15 | 3b3de4a82bae |
hex | 1d81d831dcd3 |
32443515133139 has 8 divisors (see below), whose sum is σ = 35395679424432. Its totient is φ = 29491809812640.
The previous prime is 32443515133093. The next prime is 32443515133157. The reversal of 32443515133139 is 93133151534423.
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 32443515133139 - 28 = 32443515132883 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 32443515133093 and 32443515133102.
It is not an unprimeable number, because it can be changed into a prime (32443515133439) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 114594884 + ... + 114877649.
It is an arithmetic number, because the mean of its divisors is an integer number (4424459928054).
Almost surely, 232443515133139 is an apocalyptic number.
32443515133139 is a deficient number, since it is larger than the sum of its proper divisors (2952164291293).
32443515133139 is a wasteful number, since it uses less digits than its factorization.
32443515133139 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 229485397.
The product of its digits is 1749600, while the sum is 47.
The spelling of 32443515133139 in words is "thirty-two trillion, four hundred forty-three billion, five hundred fifteen million, one hundred thirty-three thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •