Base | Representation |
---|---|
bin | 11110000001100101001011… |
… | …001010000110100101100111 |
3 | 122022112212012122222120222000 |
4 | 132001211023022012211213 |
5 | 114302001430244031033 |
6 | 1144502540241140343 |
7 | 36546204566105013 |
oct | 3601451312064547 |
9 | 568485178876860 |
10 | 132050030455143 |
11 | 390911157224a9 |
12 | 1298822002a6b3 |
13 | 588b358c90468 |
14 | 2487381429543 |
15 | 103edce934a13 |
hex | 78194b286967 |
132050030455143 has 32 divisors (see below), whose sum is σ = 198801502027200. Its totient is φ = 86617404453888.
The previous prime is 132050030455127. The next prime is 132050030455177. The reversal of 132050030455143 is 341554030050231.
132050030455143 is a `hidden beast` number, since 1 + 3 + 2 + 0 + 500 + 3 + 0 + 4 + 5 + 5 + 143 = 666.
It is not a de Polignac number, because 132050030455143 - 24 = 132050030455127 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 132050030455098 and 132050030455107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132050030455183) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 157541508 + ... + 158377481.
It is an arithmetic number, because the mean of its divisors is an integer number (6212546938350).
Almost surely, 2132050030455143 is an apocalyptic number.
132050030455143 is a deficient number, since it is larger than the sum of its proper divisors (66751471572057).
132050030455143 is a wasteful number, since it uses less digits than its factorization.
132050030455143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 315919248 (or 315919242 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 36.
The spelling of 132050030455143 in words is "one hundred thirty-two trillion, fifty billion, thirty million, four hundred fifty-five thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •