Base | Representation |
---|---|
bin | 1000111101110001000… |
… | …1001110001000011001 |
3 | 112201112212121000102101 |
4 | 2033130101032020121 |
5 | 10010412423412314 |
6 | 154431105203401 |
7 | 14061512635564 |
oct | 2173421161031 |
9 | 481485530371 |
10 | 154019357209 |
11 | 5a356a03773 |
12 | 25a24930561 |
13 | 116a71ba833 |
14 | 76515034db |
15 | 40168ca174 |
hex | 23dc44e219 |
154019357209 has 9 divisors (see below), whose sum is σ = 154512674589. Its totient is φ = 153527613600.
The previous prime is 154019357143. The next prime is 154019357227. The reversal of 154019357209 is 902753910451.
The square root of 154019357209 is 392453.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 1316601225 + 152702755984 = 36285^2 + 390772^2 .
It is not a de Polignac number, because 154019357209 - 227 = 153885139481 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (154019357299) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 235863927 + ... + 235864579.
Almost surely, 2154019357209 is an apocalyptic number.
154019357209 is the 392453-rd square number.
154019357209 is the 196227-th centered octagonal number.
It is an amenable number.
154019357209 is a deficient number, since it is larger than the sum of its proper divisors (493317380).
154019357209 is an frugal number, since it uses more digits than its factorization.
154019357209 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2508 (or 1254 counting only the distinct ones).
The product of its (nonzero) digits is 340200, while the sum is 46.
The spelling of 154019357209 in words is "one hundred fifty-four billion, nineteen million, three hundred fifty-seven thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •