Base | Representation |
---|---|
bin | 10001011010010… |
… | …00100001100101 |
3 | 101011211001201212 |
4 | 20231020201211 |
5 | 244342033000 |
6 | 22254201205 |
7 | 3422253125 |
oct | 1055104145 |
9 | 334731655 |
10 | 146049125 |
11 | 75493962 |
12 | 40ab3205 |
13 | 24347801 |
14 | 1557ac85 |
15 | cc4dc35 |
hex | 8b48865 |
146049125 has 16 divisors (see below), whose sum is σ = 192993840. Its totient is φ = 109964800.
The previous prime is 146049121. The next prime is 146049139. The reversal of 146049125 is 521940641.
It can be written as a sum of positive squares in 8 ways, for example, as 21659716 + 124389409 = 4654^2 + 11153^2 .
It is not a de Polignac number, because 146049125 - 22 = 146049121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 146049091 and 146049100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146049121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 32240 + ... + 36489.
It is an arithmetic number, because the mean of its divisors is an integer number (12062115).
Almost surely, 2146049125 is an apocalyptic number.
It is an amenable number.
146049125 is a deficient number, since it is larger than the sum of its proper divisors (46944715).
146049125 is an equidigital number, since it uses as much as digits as its factorization.
146049125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68761 (or 68751 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 32.
The square root of 146049125 is about 12085.0786095913. The cubic root of 146049125 is about 526.6227942856.
Adding to 146049125 its reverse (521940641), we get a palindrome (667989766).
The spelling of 146049125 in words is "one hundred forty-six million, forty-nine thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •