Search a number
-
+
154257447147 = 351419149049
BaseRepresentation
bin1000111110101001110…
…1011101100011101011
3112202011110121020102020
42033222131131203223
510011404401302042
6154510452235523
714100433444416
oct2175235354353
9482143536366
10154257447147
115a469342211
1225a9060bba3
131171462015b
147674d9cb7d
15402c75a3ec
hex23ea75d8eb

154257447147 has 4 divisors (see below), whose sum is σ = 205676596200. Its totient is φ = 102838298096.

The previous prime is 154257447139. The next prime is 154257447161. The reversal of 154257447147 is 741744752451.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 741744752451 = 3247248250817.

It is a cyclic number.

It is not a de Polignac number, because 154257447147 - 23 = 154257447139 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 154257447147.

It is not an unprimeable number, because it can be changed into a prime (154257447137) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25709574522 + ... + 25709574527.

It is an arithmetic number, because the mean of its divisors is an integer number (51419149050).

Almost surely, 2154257447147 is an apocalyptic number.

154257447147 is a deficient number, since it is larger than the sum of its proper divisors (51419149053).

154257447147 is an equidigital number, since it uses as much as digits as its factorization.

154257447147 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 51419149052.

The product of its digits is 4390400, while the sum is 51.

The spelling of 154257447147 in words is "one hundred fifty-four billion, two hundred fifty-seven million, four hundred forty-seven thousand, one hundred forty-seven".

Divisors: 1 3 51419149049 154257447147