Base | Representation |
---|---|
bin | 1000111011010010011… |
… | …1101010000010100001 |
3 | 112122211111212222202011 |
4 | 2032310213222002201 |
5 | 10003032130300144 |
6 | 154241103352521 |
7 | 14036154524242 |
oct | 2166447520241 |
9 | 478744788664 |
10 | 153354150049 |
11 | 5a045468791 |
12 | 25879bb2741 |
13 | 115cc440b29 |
14 | 75cb024cc9 |
15 | 3ec82cba34 |
hex | 23b49ea0a1 |
153354150049 has 2 divisors, whose sum is σ = 153354150050. Its totient is φ = 153354150048.
The previous prime is 153354150011. The next prime is 153354150091. The reversal of 153354150049 is 940051453351.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 134144190049 + 19209960000 = 366257^2 + 138600^2 .
It is an emirp because it is prime and its reverse (940051453351) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 153354150049 - 221 = 153352052897 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 153354149993 and 153354150020.
It is not a weakly prime, because it can be changed into another prime (153354100049) 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 as a sum of consecutive naturals, namely, 76677075024 + 76677075025.
It is an arithmetic number, because the mean of its divisors is an integer number (76677075025).
Almost surely, 2153354150049 is an apocalyptic number.
It is an amenable number.
153354150049 is a deficient number, since it is larger than the sum of its proper divisors (1).
153354150049 is an equidigital number, since it uses as much as digits as its factorization.
153354150049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162000, while the sum is 40.
The spelling of 153354150049 in words is "one hundred fifty-three billion, three hundred fifty-four million, one hundred fifty thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •