Base | Representation |
---|---|
bin | 10001011010110… |
… | …00111000101101 |
3 | 101011221110122221 |
4 | 20231120320231 |
5 | 244401204031 |
6 | 22255435341 |
7 | 3422652403 |
oct | 1055307055 |
9 | 334843587 |
10 | 146116141 |
11 | 7552a246 |
12 | 40b25b51 |
13 | 2436c172 |
14 | 15597473 |
15 | cc63a11 |
hex | 8b58e2d |
146116141 has 2 divisors, whose sum is σ = 146116142. Its totient is φ = 146116140.
The previous prime is 146116127. The next prime is 146116163. The reversal of 146116141 is 141611641.
It is a happy number.
146116141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 145106116 + 1010025 = 12046^2 + 1005^2 .
It is an emirp because it is prime and its reverse (141611641) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 146116141 - 223 = 137727533 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (146116111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 73058070 + 73058071.
It is an arithmetic number, because the mean of its divisors is an integer number (73058071).
Almost surely, 2146116141 is an apocalyptic number.
It is an amenable number.
146116141 is a deficient number, since it is larger than the sum of its proper divisors (1).
146116141 is an equidigital number, since it uses as much as digits as its factorization.
146116141 is an evil number, because the sum of its binary digits is even.
The product of its digits is 576, while the sum is 25.
The square root of 146116141 is about 12087.8509669833. The cubic root of 146116141 is about 526.7033305584.
Adding to 146116141 its reverse (141611641), we get a palindrome (287727782).
The spelling of 146116141 in words is "one hundred forty-six million, one hundred sixteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •