Base | Representation |
---|---|
bin | 10101000010001011111… |
… | …011000000100001110111 |
3 | 12010011222100102220211201 |
4 | 111002023323000201313 |
5 | 142140243331410033 |
6 | 3024011125313331 |
7 | 206300521432306 |
oct | 25021373004167 |
9 | 5104870386751 |
10 | 1445456513143 |
11 | 508018578425 |
12 | 1b4180565847 |
13 | a63c9285426 |
14 | 4dd6375043d |
15 | 278edbc647d |
hex | 1508bec0877 |
1445456513143 has 2 divisors, whose sum is σ = 1445456513144. Its totient is φ = 1445456513142.
The previous prime is 1445456513141. The next prime is 1445456513161. The reversal of 1445456513143 is 3413156545441.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1445456513143 - 21 = 1445456513141 is a prime.
Together with 1445456513141, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 1445456513093 and 1445456513102.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1445456513141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 722728256571 + 722728256572.
It is an arithmetic number, because the mean of its divisors is an integer number (722728256572).
Almost surely, 21445456513143 is an apocalyptic number.
1445456513143 is a deficient number, since it is larger than the sum of its proper divisors (1).
1445456513143 is an equidigital number, since it uses as much as digits as its factorization.
1445456513143 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1728000, while the sum is 46.
The spelling of 1445456513143 in words is "one trillion, four hundred forty-five billion, four hundred fifty-six million, five hundred thirteen thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •