Base | Representation |
---|---|
bin | 1000111110100110010… |
… | …0011111000111101101 |
3 | 112202010102111102100020 |
4 | 2033221210133013231 |
5 | 10011342040330331 |
6 | 154505200152353 |
7 | 14100162466662 |
oct | 2175144370755 |
9 | 482112442306 |
10 | 154242511341 |
11 | 5a460970776 |
12 | 25a876086b9 |
13 | 117114c0ab9 |
14 | 7672dd1a69 |
15 | 402b2a9c96 |
hex | 23e991f1ed |
154242511341 has 4 divisors (see below), whose sum is σ = 205656681792. Its totient is φ = 102828340892.
The previous prime is 154242511303. The next prime is 154242511361. The reversal of 154242511341 is 143115242451.
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, and also an emirpimes, since its reverse is a distinct semiprime: 143115242451 = 3 ⋅47705080817.
It is a cyclic number.
It is not a de Polignac number, because 154242511341 - 217 = 154242380269 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (154242511361) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25707085221 + ... + 25707085226.
It is an arithmetic number, because the mean of its divisors is an integer number (51414170448).
Almost surely, 2154242511341 is an apocalyptic number.
It is an amenable number.
154242511341 is a deficient number, since it is larger than the sum of its proper divisors (51414170451).
154242511341 is an equidigital number, since it uses as much as digits as its factorization.
154242511341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51414170450.
The product of its digits is 19200, while the sum is 33.
Adding to 154242511341 its reverse (143115242451), we get a palindrome (297357753792).
The spelling of 154242511341 in words is "one hundred fifty-four billion, two hundred forty-two million, five hundred eleven thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •