Base | Representation |
---|---|
bin | 10001100001001… |
… | …10011011100101 |
3 | 101020112020112212 |
4 | 20300212123211 |
5 | 300110124203 |
6 | 22325453205 |
7 | 3433060064 |
oct | 1060463345 |
9 | 336466485 |
10 | 146958053 |
11 | 75a54840 |
12 | 41271205 |
13 | 245a5438 |
14 | 157361db |
15 | cd7d1d8 |
hex | 8c266e5 |
146958053 has 4 divisors (see below), whose sum is σ = 160317888. Its totient is φ = 133598220.
The previous prime is 146958023. The next prime is 146958059. The reversal of 146958053 is 350859641.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 146958053 - 210 = 146957029 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 146958053.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146958059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6679901 + ... + 6679922.
It is an arithmetic number, because the mean of its divisors is an integer number (40079472).
Almost surely, 2146958053 is an apocalyptic number.
It is an amenable number.
146958053 is a deficient number, since it is larger than the sum of its proper divisors (13359835).
146958053 is a wasteful number, since it uses less digits than its factorization.
146958053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13359834.
The product of its (nonzero) digits is 129600, while the sum is 41.
The square root of 146958053 is about 12122.6256644343. The cubic root of 146958053 is about 527.7130042793.
The spelling of 146958053 in words is "one hundred forty-six million, nine hundred fifty-eight thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •