Base | Representation |
---|---|
bin | 10001100000110… |
… | …10100111001001 |
3 | 101020102210010211 |
4 | 20300122213021 |
5 | 300102102031 |
6 | 22324441121 |
7 | 3432465664 |
oct | 1060324711 |
9 | 336383124 |
10 | 146909641 |
11 | 75a2142a |
12 | 412491a1 |
13 | 245893a8 |
14 | 157226db |
15 | cd6dbb1 |
hex | 8c1a9c9 |
146909641 has 2 divisors, whose sum is σ = 146909642. Its totient is φ = 146909640.
The previous prime is 146909611. The next prime is 146909669.
146909641 is nontrivially palindromic in base 10.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 113316025 + 33593616 = 10645^2 + 5796^2 .
It is a palprime.
It is a cyclic number.
It is not a de Polignac number, because 146909641 - 27 = 146909513 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 146909594 and 146909603.
It is not a weakly prime, because it can be changed into another prime (146909611) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 73454820 + 73454821.
It is an arithmetic number, because the mean of its divisors is an integer number (73454821).
Almost surely, 2146909641 is an apocalyptic number.
It is an amenable number.
146909641 is a deficient number, since it is larger than the sum of its proper divisors (1).
146909641 is an equidigital number, since it uses as much as digits as its factorization.
146909641 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 46656, while the sum is 40.
The square root of 146909641 is about 12120.6287378172. The cubic root of 146909641 is about 527.6550502185.
The spelling of 146909641 in words is "one hundred forty-six million, nine hundred nine thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •