Base | Representation |
---|---|
bin | 10001011110110… |
… | …01101111100101 |
3 | 101012221021200002 |
4 | 20233121233211 |
5 | 300020101231 |
6 | 22315031045 |
7 | 3430311233 |
oct | 1057315745 |
9 | 335837602 |
10 | 146643941 |
11 | 7585a844 |
12 | 4113b485 |
13 | 244c5482 |
14 | 15693953 |
15 | cd1a0cb |
hex | 8bd9be5 |
146643941 has 2 divisors, whose sum is σ = 146643942. Its totient is φ = 146643940.
The previous prime is 146643907. The next prime is 146643949. The reversal of 146643941 is 149346641.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 122190916 + 24453025 = 11054^2 + 4945^2 .
It is a cyclic number.
It is not a de Polignac number, because 146643941 - 26 = 146643877 is a prime.
It is a super-3 number, since 3×1466439413 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 146643895 and 146643904.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (146643949) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 73321970 + 73321971.
It is an arithmetic number, because the mean of its divisors is an integer number (73321971).
Almost surely, 2146643941 is an apocalyptic number.
It is an amenable number.
146643941 is a deficient number, since it is larger than the sum of its proper divisors (1).
146643941 is an equidigital number, since it uses as much as digits as its factorization.
146643941 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 62208, while the sum is 38.
The square root of 146643941 is about 12109.6631249593. The cubic root of 146643941 is about 527.3367535400.
The spelling of 146643941 in words is "one hundred forty-six million, six hundred forty-three thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •