Base | Representation |
---|---|
bin | 10001100000101… |
… | …11101100011101 |
3 | 101020102011202022 |
4 | 20300113230131 |
5 | 300101211233 |
6 | 22324305525 |
7 | 3432416105 |
oct | 1060275435 |
9 | 336364668 |
10 | 146897693 |
11 | 75a13458 |
12 | 412422a5 |
13 | 24583b17 |
14 | 1571c205 |
15 | cd6a398 |
hex | 8c17b1d |
146897693 has 4 divisors (see below), whose sum is σ = 147053760. Its totient is φ = 146741628.
The previous prime is 146897687. The next prime is 146897717. The reversal of 146897693 is 396798641.
146897693 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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, and also an emirpimes, since its reverse is a distinct semiprime: 396798641 = 19 ⋅20884139.
It is a cyclic number.
It is not a de Polignac number, because 146897693 - 24 = 146897677 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146897293) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 76613 + ... + 78506.
It is an arithmetic number, because the mean of its divisors is an integer number (36763440).
Almost surely, 2146897693 is an apocalyptic number.
It is an amenable number.
146897693 is a deficient number, since it is larger than the sum of its proper divisors (156067).
146897693 is an equidigital number, since it uses as much as digits as its factorization.
146897693 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 156066.
The product of its digits is 1959552, while the sum is 53.
The square root of 146897693 is about 12120.1358490736. The cubic root of 146897693 is about 527.6407452951.
The spelling of 146897693 in words is "one hundred forty-six million, eight hundred ninety-seven thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •