Base | Representation |
---|---|
bin | 10010010000011… |
… | …11001001011101 |
3 | 101200012000222121 |
4 | 21020033021131 |
5 | 303201413031 |
6 | 23110342541 |
7 | 3536534350 |
oct | 1110171135 |
9 | 350160877 |
10 | 153154141 |
11 | 794a6a78 |
12 | 4335aa51 |
13 | 2596476a |
14 | 164aa297 |
15 | d6a4011 |
hex | 920f25d |
153154141 has 4 divisors (see below), whose sum is σ = 175033312. Its totient is φ = 131274972.
The previous prime is 153154123. The next prime is 153154159. The reversal of 153154141 is 141451351.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (153154123) and next prime (153154159).
It is a cyclic number.
It is not a de Polignac number, because 153154141 - 25 = 153154109 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (153157141) 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 in 3 ways as a sum of consecutive naturals, for example, 10939575 + ... + 10939588.
It is an arithmetic number, because the mean of its divisors is an integer number (43758328).
Almost surely, 2153154141 is an apocalyptic number.
It is an amenable number.
153154141 is a deficient number, since it is larger than the sum of its proper divisors (21879171).
153154141 is an equidigital number, since it uses as much as digits as its factorization.
153154141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21879170.
The product of its digits is 1200, while the sum is 25.
The square root of 153154141 is about 12375.5460889611. The cubic root of 153154141 is about 535.0276760947.
The spelling of 153154141 in words is "one hundred fifty-three million, one hundred fifty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •