Base | Representation |
---|---|
bin | 111101100010001000… |
… | …1101111100100111101 |
3 | 110122002012111100110100 |
4 | 1323010101233210331 |
5 | 4131111323121131 |
6 | 140412153431313 |
7 | 12355413335361 |
oct | 1730421574475 |
9 | 418065440410 |
10 | 132142004541 |
11 | 5104a797918 |
12 | 2173a10b539 |
13 | c5cb8ab741 |
14 | 6577b6b2a1 |
15 | 3685e267e6 |
hex | 1ec446f93d |
132142004541 has 6 divisors (see below), whose sum is σ = 190871784350. Its totient is φ = 88094669688.
The previous prime is 132142004537. The next prime is 132142004567. The reversal of 132142004541 is 145400241231.
132142004541 is a `hidden beast` number, since 1 + 3 + 2 + 1 + 4 + 200 + 454 + 1 = 666.
It can be written as a sum of positive squares in only one way, i.e., 102300824025 + 29841180516 = 319845^2 + 172746^2 .
It is not a de Polignac number, because 132142004541 - 22 = 132142004537 is a prime.
It is a super-2 number, since 2×1321420045412 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132142004591) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 7341222466 + ... + 7341222483.
Almost surely, 2132142004541 is an apocalyptic number.
It is an amenable number.
132142004541 is a deficient number, since it is larger than the sum of its proper divisors (58729779809).
132142004541 is a wasteful number, since it uses less digits than its factorization.
132142004541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14682444955 (or 14682444952 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 27.
Adding to 132142004541 its reverse (145400241231), we get a palindrome (277542245772).
The spelling of 132142004541 in words is "one hundred thirty-two billion, one hundred forty-two million, four thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •