Base | Representation |
---|---|
bin | 11110000011000010110111… |
… | …101000010011101010001101 |
3 | 122022220110212221100122110220 |
4 | 132003002313220103222031 |
5 | 114310123444421411031 |
6 | 1145021055144221553 |
7 | 36556365626640411 |
oct | 3603026750235215 |
9 | 568813787318426 |
10 | 132150634560141 |
11 | 3911a85105a62a |
12 | 129a381816a8b9 |
13 | 589799c9a5082 |
14 | 248c1a67c0d41 |
15 | 104281bbed596 |
hex | 7830b7a13a8d |
132150634560141 has 16 divisors (see below), whose sum is σ = 176441892418176. Its totient is φ = 87979968032256.
The previous prime is 132150634560079. The next prime is 132150634560151. The reversal of 132150634560141 is 141065436051231.
It is not a de Polignac number, because 132150634560141 - 27 = 132150634560013 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 132150634560093 and 132150634560102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132150634560151) 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 15 ways as a sum of consecutive naturals, for example, 761580 + ... + 16275173.
It is an arithmetic number, because the mean of its divisors is an integer number (11027618276136).
Almost surely, 2132150634560141 is an apocalyptic number.
It is an amenable number.
132150634560141 is a deficient number, since it is larger than the sum of its proper divisors (44291257858035).
132150634560141 is a wasteful number, since it uses less digits than its factorization.
132150634560141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17040292.
The product of its (nonzero) digits is 259200, while the sum is 42.
The spelling of 132150634560141 in words is "one hundred thirty-two trillion, one hundred fifty billion, six hundred thirty-four million, five hundred sixty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •