Base | Representation |
---|---|
bin | 10001100000000… |
… | …00011101111001 |
3 | 101020020100020121 |
4 | 20300000131321 |
5 | 300040140203 |
6 | 22322253241 |
7 | 3431541532 |
oct | 1060003571 |
9 | 336210217 |
10 | 146802553 |
11 | 75958a27 |
12 | 411b7221 |
13 | 2454c721 |
14 | 156d5689 |
15 | cd4c0bd |
hex | 8c00779 |
146802553 has 4 divisors (see below), whose sum is σ = 151864740. Its totient is φ = 141740368.
The previous prime is 146802547. The next prime is 146802589. The reversal of 146802553 is 355208641.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 355208641 = 13523 ⋅26267.
It can be written as a sum of positive squares in 2 ways, for example, as 41062464 + 105740089 = 6408^2 + 10283^2 .
It is a cyclic number.
It is not a de Polignac number, because 146802553 - 221 = 144705401 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (146800553) 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, 2531050 + ... + 2531107.
It is an arithmetic number, because the mean of its divisors is an integer number (37966185).
Almost surely, 2146802553 is an apocalyptic number.
It is an amenable number.
146802553 is a deficient number, since it is larger than the sum of its proper divisors (5062187).
146802553 is an equidigital number, since it uses as much as digits as its factorization.
146802553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5062186.
The product of its (nonzero) digits is 28800, while the sum is 34.
The square root of 146802553 is about 12116.2103398711. The cubic root of 146802553 is about 527.5268098052.
The spelling of 146802553 in words is "one hundred forty-six million, eight hundred two thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •