Base | Representation |
---|---|
bin | 10010011000000… |
… | …10000010110001 |
3 | 101202001120201202 |
4 | 21030002002301 |
5 | 303430232131 |
6 | 23143540545 |
7 | 3551150054 |
oct | 1114020261 |
9 | 352046652 |
10 | 154149041 |
11 | 7a016502 |
12 | 4375a755 |
13 | 25c22567 |
14 | 16688a9b |
15 | d7edbcb |
hex | 93020b1 |
154149041 has 2 divisors, whose sum is σ = 154149042. Its totient is φ = 154149040.
The previous prime is 154149029. The next prime is 154149091. The reversal of 154149041 is 140941451.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 102596641 + 51552400 = 10129^2 + 7180^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-154149041 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 154148995 and 154149013.
It is not a weakly prime, because it can be changed into another prime (154149001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 77074520 + 77074521.
It is an arithmetic number, because the mean of its divisors is an integer number (77074521).
Almost surely, 2154149041 is an apocalyptic number.
It is an amenable number.
154149041 is a deficient number, since it is larger than the sum of its proper divisors (1).
154149041 is an equidigital number, since it uses as much as digits as its factorization.
154149041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2880, while the sum is 29.
The square root of 154149041 is about 12415.6772267968. The cubic root of 154149041 is about 536.1837022089.
The spelling of 154149041 in words is "one hundred fifty-four million, one hundred forty-nine thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •