Base | Representation |
---|---|
bin | 11110000001000011101101… |
… | …100110001000000011110101 |
3 | 122022102102110200101101111001 |
4 | 132001003231212020003311 |
5 | 114300404334324121113 |
6 | 1144434235112243301 |
7 | 36543463326603106 |
oct | 3601035546100365 |
9 | 568372420341431 |
10 | 132014101004533 |
11 | 39077958464470 |
12 | 129812733a0531 |
13 | 5887b51331207 |
14 | 24857336d83ad |
15 | 103deca4ab7dd |
hex | 7810ed9880f5 |
132014101004533 has 8 divisors (see below), whose sum is σ = 148661040427776. Its totient is φ = 116141437833600.
The previous prime is 132014101004521. The next prime is 132014101004561. The reversal of 132014101004533 is 335400101410231.
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 132014101004533 - 233 = 132005511069941 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132014101004503) 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, 193569062716 + ... + 193569063397.
It is an arithmetic number, because the mean of its divisors is an integer number (18582630053472).
Almost surely, 2132014101004533 is an apocalyptic number.
It is an amenable number.
132014101004533 is a deficient number, since it is larger than the sum of its proper divisors (16646939423243).
132014101004533 is a wasteful number, since it uses less digits than its factorization.
132014101004533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 387138126155.
The product of its (nonzero) digits is 4320, while the sum is 28.
Adding to 132014101004533 its reverse (335400101410231), we get a palindrome (467414202414764).
The spelling of 132014101004533 in words is "one hundred thirty-two trillion, fourteen billion, one hundred one million, four thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •