Base | Representation |
---|---|
bin | 10101001101100011001… |
… | …011101111111001010001 |
3 | 12011100110200120111110010 |
4 | 111031203023233321101 |
5 | 142340240412444424 |
6 | 3033345552225133 |
7 | 210212060015115 |
oct | 25154313577121 |
9 | 5140420514403 |
10 | 1457657937489 |
11 | 5122099a50a6 |
12 | 1b660683b1a9 |
13 | a75c2082650 |
14 | 507a0001745 |
15 | 27db4e83229 |
hex | 153632efe51 |
1457657937489 has 8 divisors (see below), whose sum is σ = 2093047294912. Its totient is φ = 897020269200.
The previous prime is 1457657937487. The next prime is 1457657937499. The reversal of 1457657937489 is 9847397567541.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1457657937489 - 21 = 1457657937487 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1457657937489.
It is not an unprimeable number, because it can be changed into a prime (1457657937487) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18687922237 + ... + 18687922314.
It is an arithmetic number, because the mean of its divisors is an integer number (261630911864).
Almost surely, 21457657937489 is an apocalyptic number.
It is an amenable number.
1457657937489 is a deficient number, since it is larger than the sum of its proper divisors (635389357423).
1457657937489 is a wasteful number, since it uses less digits than its factorization.
1457657937489 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37375844567.
The product of its digits is 1600300800, while the sum is 75.
The spelling of 1457657937489 in words is "one trillion, four hundred fifty-seven billion, six hundred fifty-seven million, nine hundred thirty-seven thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •