Base | Representation |
---|---|
bin | 1000100001110010100… |
… | …0001001110110000101 |
3 | 112000011110212021212002 |
4 | 2020130220021312011 |
5 | 4400022322114242 |
6 | 151145544035045 |
7 | 13404430310246 |
oct | 2103450116605 |
9 | 460143767762 |
10 | 146509176197 |
11 | 571526795aa |
12 | 24489762a85 |
13 | 10a7b2a6747 |
14 | 713bd00ccd |
15 | 3c273d6432 |
hex | 221ca09d85 |
146509176197 has 4 divisors (see below), whose sum is σ = 146885806860. Its totient is φ = 146132545536.
The previous prime is 146509176119. The next prime is 146509176239. The reversal of 146509176197 is 791671905641.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 791671905641 = 29 ⋅27299031229.
It can be written as a sum of positive squares in 2 ways, for example, as 42019260196 + 104489916001 = 204986^2 + 323249^2 .
It is a cyclic number.
It is not a de Polignac number, because 146509176197 - 214 = 146509159813 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 (146509176097) 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, 188314748 + ... + 188315525.
It is an arithmetic number, because the mean of its divisors is an integer number (36721451715).
Almost surely, 2146509176197 is an apocalyptic number.
It is an amenable number.
146509176197 is a deficient number, since it is larger than the sum of its proper divisors (376630663).
146509176197 is an equidigital number, since it uses as much as digits as its factorization.
146509176197 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 376630662.
The product of its (nonzero) digits is 2857680, while the sum is 56.
The spelling of 146509176197 in words is "one hundred forty-six billion, five hundred nine million, one hundred seventy-six thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •