Base | Representation |
---|---|
bin | 10001011111100… |
… | …01111110111101 |
3 | 101020010022212102 |
4 | 20233301332331 |
5 | 300031240404 |
6 | 22321114445 |
7 | 3431203553 |
oct | 1057617675 |
9 | 336108772 |
10 | 146743229 |
11 | 759183a6 |
12 | 41188a25 |
13 | 2452b719 |
14 | 156bbbd3 |
15 | cd3971e |
hex | 8bf1fbd |
146743229 has 2 divisors, whose sum is σ = 146743230. Its totient is φ = 146743228.
The previous prime is 146743193. The next prime is 146743241. The reversal of 146743229 is 922347641.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 130759225 + 15984004 = 11435^2 + 3998^2 .
It is an emirp because it is prime and its reverse (922347641) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-146743229 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 146743192 and 146743201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (146743279) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 73371614 + 73371615.
It is an arithmetic number, because the mean of its divisors is an integer number (73371615).
Almost surely, 2146743229 is an apocalyptic number.
It is an amenable number.
146743229 is a deficient number, since it is larger than the sum of its proper divisors (1).
146743229 is an equidigital number, since it uses as much as digits as its factorization.
146743229 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 72576, while the sum is 38.
The square root of 146743229 is about 12113.7619672833. The cubic root of 146743229 is about 527.4557410663.
The spelling of 146743229 in words is "one hundred forty-six million, seven hundred forty-three thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •