Base | Representation |
---|---|
bin | 1000101110110010100… |
… | …1001101010101101001 |
3 | 112100011200210110221002 |
4 | 2023230221031111221 |
5 | 4424144233113302 |
6 | 152524133324345 |
7 | 13560055266635 |
oct | 2135451152551 |
9 | 470150713832 |
10 | 149999113577 |
11 | 58683653175 |
12 | 250a24966b5 |
13 | 111b632bb51 |
14 | 738d5dddc5 |
15 | 3d7d9a6c02 |
hex | 22eca4d569 |
149999113577 has 2 divisors, whose sum is σ = 149999113578. Its totient is φ = 149999113576.
The previous prime is 149999113571. The next prime is 149999113609. The reversal of 149999113577 is 775311999941.
149999113577 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 148089510976 + 1909602601 = 384824^2 + 43699^2 .
It is an emirp because it is prime and its reverse (775311999941) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 149999113577 - 228 = 149730678121 is a prime.
It is not a weakly prime, because it can be changed into another prime (149999113571) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 74999556788 + 74999556789.
It is an arithmetic number, because the mean of its divisors is an integer number (74999556789).
Almost surely, 2149999113577 is an apocalyptic number.
It is an amenable number.
149999113577 is a deficient number, since it is larger than the sum of its proper divisors (1).
149999113577 is an equidigital number, since it uses as much as digits as its factorization.
149999113577 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 19289340, while the sum is 65.
The spelling of 149999113577 in words is "one hundred forty-nine billion, nine hundred ninety-nine million, one hundred thirteen thousand, five hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •