Base | Representation |
---|---|
bin | 100000110111011010111101… |
… | …111000001110110010011111 |
3 | 200221210110112022111212100101 |
4 | 200313122331320032302133 |
5 | 122421220214320422142 |
6 | 1231231304513441531 |
7 | 42306051000242503 |
oct | 4067327570166237 |
9 | 627713468455311 |
10 | 144546015014047 |
11 | 42069691194439 |
12 | 14265b9bb702a7 |
13 | 628682793105a |
14 | 279a0c8c18303 |
15 | 11a9e90bb30b7 |
hex | 8376bde0ec9f |
144546015014047 has 2 divisors, whose sum is σ = 144546015014048. Its totient is φ = 144546015014046.
The previous prime is 144546015014033. The next prime is 144546015014087. The reversal of 144546015014047 is 740410510645441.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-144546015014047 is a prime.
It is a super-2 number, since 2×1445460150140472 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 144546015013988 and 144546015014006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (144546015014087) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72273007507023 + 72273007507024.
It is an arithmetic number, because the mean of its divisors is an integer number (72273007507024).
Almost surely, 2144546015014047 is an apocalyptic number.
144546015014047 is a deficient number, since it is larger than the sum of its proper divisors (1).
144546015014047 is an equidigital number, since it uses as much as digits as its factorization.
144546015014047 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1075200, while the sum is 46.
Adding to 144546015014047 its reverse (740410510645441), we get a palindrome (884956525659488).
The spelling of 144546015014047 in words is "one hundred forty-four trillion, five hundred forty-six billion, fifteen million, fourteen thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •