Base | Representation |
---|---|
bin | 100010110111101111110110… |
… | …100100101011111110010101 |
3 | 202010000111200001212112200001 |
4 | 202313233312210223332111 |
5 | 130100211031204110314 |
6 | 1302102405545251301 |
7 | 44206136060260432 |
oct | 4267576644537625 |
9 | 663014601775601 |
10 | 153364534050709 |
11 | 449595962a2743 |
12 | 1524b0a8193b31 |
13 | 67762a10c1027 |
14 | 29c2c51158b89 |
15 | 12ae56bb4c674 |
hex | 8b7bf692bf95 |
153364534050709 has 2 divisors, whose sum is σ = 153364534050710. Its totient is φ = 153364534050708.
The previous prime is 153364534050619. The next prime is 153364534050797. The reversal of 153364534050709 is 907050435463351.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 141411458639025 + 11953075411684 = 11891655^2 + 3457322^2 .
It is a cyclic number.
It is not a de Polignac number, because 153364534050709 - 29 = 153364534050197 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 153364534050709.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (153364034050709) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 76682267025354 + 76682267025355.
It is an arithmetic number, because the mean of its divisors is an integer number (76682267025355).
Almost surely, 2153364534050709 is an apocalyptic number.
It is an amenable number.
153364534050709 is a deficient number, since it is larger than the sum of its proper divisors (1).
153364534050709 is an equidigital number, since it uses as much as digits as its factorization.
153364534050709 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 20412000, while the sum is 55.
The spelling of 153364534050709 in words is "one hundred fifty-three trillion, three hundred sixty-four billion, five hundred thirty-four million, fifty thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •