Base | Representation |
---|---|
bin | 1000110110110100011… |
… | …1011101010110101011 |
3 | 112112201220120211111022 |
4 | 2031231013131112223 |
5 | 4443103024332042 |
6 | 153522051323055 |
7 | 13664350066340 |
oct | 2155507352653 |
9 | 475656524438 |
10 | 152154527147 |
11 | 5958a29a2a7 |
12 | 255a42b048b |
13 | 1146aa4c1ac |
14 | 75159927c7 |
15 | 3e57d17cd2 |
hex | 236d1dd5ab |
152154527147 has 8 divisors (see below), whose sum is σ = 173895772416. Its totient is φ = 130414502952.
The previous prime is 152154527141. The next prime is 152154527153. The reversal of 152154527147 is 741725451251.
It is an interprime number because it is at equal distance from previous prime (152154527141) and next prime (152154527153).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 152154527147 - 24 = 152154527131 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 152154527098 and 152154527107.
It is not an unprimeable number, because it can be changed into a prime (152154527141) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20543 + ... + 552024.
It is an arithmetic number, because the mean of its divisors is an integer number (21736971552).
Almost surely, 2152154527147 is an apocalyptic number.
152154527147 is a deficient number, since it is larger than the sum of its proper divisors (21741245269).
152154527147 is an equidigital number, since it uses as much as digits as its factorization.
152154527147 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 610537.
The product of its digits is 392000, while the sum is 44.
Adding to 152154527147 its reverse (741725451251), we get a palindrome (893879978398).
The spelling of 152154527147 in words is "one hundred fifty-two billion, one hundred fifty-four million, five hundred twenty-seven thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •