Base | Representation |
---|---|
bin | 100010110101111011111000… |
… | …100110011010000101000011 |
3 | 202002120121021001102210111111 |
4 | 202311323320212122011003 |
5 | 130041141022041121142 |
6 | 1301525253544424151 |
7 | 44164140254324041 |
oct | 4265737046320503 |
9 | 662517231383444 |
10 | 153240014004547 |
11 | 449107a7a45a88 |
12 | 1522ab36778057 |
13 | 6767618631a42 |
14 | 29babdb7a9391 |
15 | 12ab1cee48e17 |
hex | 8b5ef899a143 |
153240014004547 has 2 divisors, whose sum is σ = 153240014004548. Its totient is φ = 153240014004546.
The previous prime is 153240014004527. The next prime is 153240014004589. The reversal of 153240014004547 is 745400410042351.
153240014004547 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 is a cyclic number.
It is not a de Polignac number, because 153240014004547 - 235 = 153205654266179 is a prime.
It is a super-2 number, since 2×1532400140045472 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (153240014004527) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 76620007002273 + 76620007002274.
It is an arithmetic number, because the mean of its divisors is an integer number (76620007002274).
Almost surely, 2153240014004547 is an apocalyptic number.
153240014004547 is a deficient number, since it is larger than the sum of its proper divisors (1).
153240014004547 is an equidigital number, since it uses as much as digits as its factorization.
153240014004547 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 268800, while the sum is 40.
Adding to 153240014004547 its reverse (745400410042351), we get a palindrome (898640424046898).
The spelling of 153240014004547 in words is "one hundred fifty-three trillion, two hundred forty billion, fourteen million, four thousand, five hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •