Base | Representation |
---|---|
bin | 10001011010101… |
… | …10011010111001 |
3 | 101011220221210212 |
4 | 20231112122321 |
5 | 244400343131 |
6 | 22255320505 |
7 | 3422611064 |
oct | 1055263271 |
9 | 334827725 |
10 | 146106041 |
11 | 755226a4 |
12 | 40b20135 |
13 | 243676a3 |
14 | 155938db |
15 | cc60a2b |
hex | 8b566b9 |
146106041 has 8 divisors (see below), whose sum is σ = 157237704. Its totient is φ = 135256320.
The previous prime is 146106019. The next prime is 146106043. The reversal of 146106041 is 140601641.
It can be written as a sum of positive squares in 4 ways, for example, as 35940025 + 110166016 = 5995^2 + 10496^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-146106041 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 146105998 and 146106016.
It is not an unprimeable number, because it can be changed into a prime (146106043) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 69410 + ... + 71483.
It is an arithmetic number, because the mean of its divisors is an integer number (19654713).
Almost surely, 2146106041 is an apocalyptic number.
It is an amenable number.
146106041 is a deficient number, since it is larger than the sum of its proper divisors (11131663).
146106041 is a wasteful number, since it uses less digits than its factorization.
146106041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140971.
The product of its (nonzero) digits is 576, while the sum is 23.
The square root of 146106041 is about 12087.4331849239. The cubic root of 146106041 is about 526.6911944905.
Adding to 146106041 its reverse (140601641), we get a palindrome (286707682).
The spelling of 146106041 in words is "one hundred forty-six million, one hundred six thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •