Base | Representation |
---|---|
bin | 1000001110111111110… |
… | …0101010010101001101 |
3 | 111112010220121210010122 |
4 | 2003233330222111031 |
5 | 4304204420011000 |
6 | 144553221314325 |
7 | 13135424226446 |
oct | 2035774522515 |
9 | 445126553118 |
10 | 141464610125 |
11 | 54aa40a2433 |
12 | 235002659a5 |
13 | 10456142bc7 |
14 | 6bbdd5c2cd |
15 | 3a2e5ca085 |
hex | 20eff2a54d |
141464610125 has 12 divisors (see below), whose sum is σ = 176553081588. Its totient is φ = 113168324000.
The previous prime is 141464610121. The next prime is 141464610139. The reversal of 141464610125 is 521016464141.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 6 ways, for example, as 9338903044 + 132125707081 = 96638^2 + 363491^2 .
It is not a de Polignac number, because 141464610125 - 22 = 141464610121 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 (141464610121) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4188305 + ... + 4221945.
It is an arithmetic number, because the mean of its divisors is an integer number (14712756799).
Almost surely, 2141464610125 is an apocalyptic number.
It is an amenable number.
141464610125 is a deficient number, since it is larger than the sum of its proper divisors (35088471463).
141464610125 is an frugal number, since it uses more digits than its factorization.
141464610125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67297 (or 33646 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 35.
The spelling of 141464610125 in words is "one hundred forty-one billion, four hundred sixty-four million, six hundred ten thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •