Base | Representation |
---|---|
bin | 10001100001001… |
… | …00010011011001 |
3 | 101020111210121001 |
4 | 20300210103121 |
5 | 300104334322 |
6 | 22325345001 |
7 | 3433022503 |
oct | 1060442331 |
9 | 336453531 |
10 | 146949337 |
11 | 75a49237 |
12 | 41268161 |
13 | 245a1492 |
14 | 15732d73 |
15 | cd7a827 |
hex | 8c244d9 |
146949337 has 4 divisors (see below), whose sum is σ = 149722020. Its totient is φ = 144176656.
The previous prime is 146949329. The next prime is 146949347. The reversal of 146949337 is 733949641.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 39702601 + 107246736 = 6301^2 + 10356^2 .
It is a cyclic number.
It is not a de Polignac number, because 146949337 - 23 = 146949329 is a prime.
It is a super-3 number, since 3×1469493373 (a number of 25 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (146949317) 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 3 ways as a sum of consecutive naturals, for example, 1386262 + ... + 1386367.
It is an arithmetic number, because the mean of its divisors is an integer number (37430505).
Almost surely, 2146949337 is an apocalyptic number.
It is an amenable number.
146949337 is a deficient number, since it is larger than the sum of its proper divisors (2772683).
146949337 is an equidigital number, since it uses as much as digits as its factorization.
146949337 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2772682.
The product of its digits is 489888, while the sum is 46.
The square root of 146949337 is about 12122.2661660269. The cubic root of 146949337 is about 527.7025712853.
The spelling of 146949337 in words is "one hundred forty-six million, nine hundred forty-nine thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •