Base | Representation |
---|---|
bin | 1000111110111100010… |
… | …1010110000011101101 |
3 | 112202100212112220002111 |
4 | 2033233011112003231 |
5 | 10012034230323203 |
6 | 154522302524021 |
7 | 14102364643306 |
oct | 2175705260355 |
9 | 482325486074 |
10 | 154335011053 |
11 | 5a4a90aa113 |
12 | 25ab2596611 |
13 | 11727709762 |
14 | 76813cd7ad |
15 | 403447c26d |
hex | 23ef1560ed |
154335011053 has 2 divisors, whose sum is σ = 154335011054. Its totient is φ = 154335011052.
The previous prime is 154335011041. The next prime is 154335011059. The reversal of 154335011053 is 350110533451.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 138683249604 + 15651761449 = 372402^2 + 125107^2 .
It is a cyclic number.
It is not a de Polignac number, because 154335011053 - 217 = 154334879981 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (154335011059) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 77167505526 + 77167505527.
It is an arithmetic number, because the mean of its divisors is an integer number (77167505527).
Almost surely, 2154335011053 is an apocalyptic number.
It is an amenable number.
154335011053 is a deficient number, since it is larger than the sum of its proper divisors (1).
154335011053 is an equidigital number, since it uses as much as digits as its factorization.
154335011053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13500, while the sum is 31.
The spelling of 154335011053 in words is "one hundred fifty-four billion, three hundred thirty-five million, eleven thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •