Base | Representation |
---|---|
bin | 10001011110011… |
… | …10011001000001 |
3 | 101012211220212212 |
4 | 20233032121001 |
5 | 300012104231 |
6 | 22314031505 |
7 | 3430025534 |
oct | 1057163101 |
9 | 335756785 |
10 | 146597441 |
11 | 75828911 |
12 | 41118595 |
13 | 244aa263 |
14 | 15680a1b |
15 | cd0b42b |
hex | 8bce641 |
146597441 has 4 divisors (see below), whose sum is σ = 150559572. Its totient is φ = 142635312.
The previous prime is 146597431. The next prime is 146597459. The reversal of 146597441 is 144795641.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 144795641 = 41 ⋅3531601.
It can be written as a sum of positive squares in 2 ways, for example, as 139334416 + 7263025 = 11804^2 + 2695^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-146597441 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (146597401) 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, 1981010 + ... + 1981083.
It is an arithmetic number, because the mean of its divisors is an integer number (37639893).
Almost surely, 2146597441 is an apocalyptic number.
It is an amenable number.
146597441 is a deficient number, since it is larger than the sum of its proper divisors (3962131).
146597441 is an equidigital number, since it uses as much as digits as its factorization.
146597441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3962130.
The product of its digits is 120960, while the sum is 41.
The square root of 146597441 is about 12107.7430184159. The cubic root of 146597441 is about 527.2810091041.
The spelling of 146597441 in words is "one hundred forty-six million, five hundred ninety-seven thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •