Base | Representation |
---|---|
bin | 11110000110110101011110… |
… | …111101110110010110101111 |
3 | 122100211101022000101011212220 |
4 | 132012311132331312112233 |
5 | 114323411003322240421 |
6 | 1145340501000530423 |
7 | 36614250325661562 |
oct | 3606653675662657 |
9 | 570741260334786 |
10 | 132411140040111 |
11 | 39210281668429 |
12 | 12a261baa80a13 |
13 | 58b64173a48aa |
14 | 249aa3a5364d9 |
15 | 10494b6e723c6 |
hex | 786d5ef765af |
132411140040111 has 8 divisors (see below), whose sum is σ = 176548426978560. Its totient is φ = 88273973230872.
The previous prime is 132411140040083. The next prime is 132411140040131. The reversal of 132411140040111 is 111040041114231.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 132411140040111 - 215 = 132411140007343 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132411140040131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27428151 + ... + 31892408.
It is an arithmetic number, because the mean of its divisors is an integer number (22068553372320).
Almost surely, 2132411140040111 is an apocalyptic number.
132411140040111 is a deficient number, since it is larger than the sum of its proper divisors (44137286938449).
132411140040111 is an equidigital number, since it uses as much as digits as its factorization.
132411140040111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60064605.
The product of its (nonzero) digits is 384, while the sum is 24.
Adding to 132411140040111 its reverse (111040041114231), we get a palindrome (243451181154342).
The spelling of 132411140040111 in words is "one hundred thirty-two trillion, four hundred eleven billion, one hundred forty million, forty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •