Base | Representation |
---|---|
bin | 10001011011110… |
… | …11000100100001 |
3 | 101012012120201212 |
4 | 20231323010201 |
5 | 244420144121 |
6 | 22302435505 |
7 | 3424104542 |
oct | 1055730441 |
9 | 335176655 |
10 | 146256161 |
11 | 75615467 |
12 | 40b92b95 |
13 | 243bab0c |
14 | 155d24c9 |
15 | cc9025b |
hex | 8b7b121 |
146256161 has 2 divisors, whose sum is σ = 146256162. Its totient is φ = 146256160.
The previous prime is 146256119. The next prime is 146256163. The reversal of 146256161 is 161652641.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 75359761 + 70896400 = 8681^2 + 8420^2 .
It is a cyclic number.
It is not a de Polignac number, because 146256161 - 214 = 146239777 is a prime.
It is a Sophie Germain prime.
Together with 146256163, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (146256163) 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 as a sum of consecutive naturals, namely, 73128080 + 73128081.
It is an arithmetic number, because the mean of its divisors is an integer number (73128081).
Almost surely, 2146256161 is an apocalyptic number.
It is an amenable number.
146256161 is a deficient number, since it is larger than the sum of its proper divisors (1).
146256161 is an equidigital number, since it uses as much as digits as its factorization.
146256161 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 8640, while the sum is 32.
The square root of 146256161 is about 12093.6413457651. The cubic root of 146256161 is about 526.8715197240.
The spelling of 146256161 in words is "one hundred forty-six million, two hundred fifty-six thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.121 sec. • engine limits •