Base | Representation |
---|---|
bin | 10100010101111101100100… |
… | …010101001010111111010101 |
3 | 102201210021002101012202222101 |
4 | 110111331210111022333111 |
5 | 43211334330113431423 |
6 | 514142003525202101 |
7 | 24563001435433411 |
oct | 2425754425127725 |
9 | 381707071182871 |
10 | 89470147014613 |
11 | 26565092564a12 |
12 | a04bab7260331 |
13 | 3abccca09c981 |
14 | 1814541ba3d41 |
15 | a524cceae7ad |
hex | 515f6454afd5 |
89470147014613 has 4 divisors (see below), whose sum is σ = 94733096839020. Its totient is φ = 84207197190208.
The previous prime is 89470147014559. The next prime is 89470147014631. The reversal of 89470147014613 is 31641074107498.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 81206465400369 + 8263681614244 = 9011463^2 + 2874662^2 .
It is a cyclic number.
It is not a de Polignac number, because 89470147014613 - 213 = 89470147006421 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (89470147014713) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2631474912178 + ... + 2631474912211.
It is an arithmetic number, because the mean of its divisors is an integer number (23683274209755).
Almost surely, 289470147014613 is an apocalyptic number.
It is an amenable number.
89470147014613 is a deficient number, since it is larger than the sum of its proper divisors (5262949824407).
89470147014613 is a wasteful number, since it uses less digits than its factorization.
89470147014613 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5262949824406.
The product of its (nonzero) digits is 4064256, while the sum is 55.
The spelling of 89470147014613 in words is "eighty-nine trillion, four hundred seventy billion, one hundred forty-seven million, fourteen thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •