Base | Representation |
---|---|
bin | 10101001101110010000… |
… | …000110100010010011111 |
3 | 12011101010000201110210212 |
4 | 111031302000310102133 |
5 | 142341243110331033 |
6 | 3033430400523035 |
7 | 210221200511123 |
oct | 25156200642237 |
9 | 5141100643725 |
10 | 1457906730143 |
11 | 512327383766 |
12 | 1b667602047b |
13 | a7631791636 |
14 | 507c5085583 |
15 | 27dcbc29748 |
hex | 1537203449f |
1457906730143 has 4 divisors (see below), whose sum is σ = 1508179376040. Its totient is φ = 1407634084248.
The previous prime is 1457906730139. The next prime is 1457906730199. The reversal of 1457906730143 is 3410376097541.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1457906730143 - 22 = 1457906730139 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1457906730091 and 1457906730100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1457906730103) 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 in 3 ways as a sum of consecutive naturals, for example, 25136322905 + ... + 25136322962.
It is an arithmetic number, because the mean of its divisors is an integer number (377044844010).
Almost surely, 21457906730143 is an apocalyptic number.
1457906730143 is a deficient number, since it is larger than the sum of its proper divisors (50272645897).
1457906730143 is an equidigital number, since it uses as much as digits as its factorization.
1457906730143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50272645896.
The product of its (nonzero) digits is 1905120, while the sum is 50.
The spelling of 1457906730143 in words is "one trillion, four hundred fifty-seven billion, nine hundred six million, seven hundred thirty thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •