Base | Representation |
---|---|
bin | 1101101011101101010… |
… | …00001011010110001101 |
3 | 1122221111222111211220101 |
4 | 12311312220023112031 |
5 | 30200322232211424 |
6 | 555551411451101 |
7 | 45652356222643 |
oct | 6656650132615 |
9 | 1587458454811 |
10 | 470141678989 |
11 | 1714277a2a44 |
12 | 771495b6a91 |
13 | 354462302c8 |
14 | 18a7d939193 |
15 | c369693344 |
hex | 6d76a0b58d |
470141678989 has 2 divisors, whose sum is σ = 470141678990. Its totient is φ = 470141678988.
The previous prime is 470141678987. The next prime is 470141679031. The reversal of 470141678989 is 989876141074.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 333988058889 + 136153620100 = 577917^2 + 368990^2 .
It is a cyclic number.
It is not a de Polignac number, because 470141678989 - 21 = 470141678987 is a prime.
Together with 470141678987, it forms a pair of twin primes.
It is an alternating number because its digits alternate between even and odd.
It is a self number, because there is not a number n which added to its sum of digits gives 470141678989.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (470141678987) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 235070839494 + 235070839495.
It is an arithmetic number, because the mean of its divisors is an integer number (235070839495).
Almost surely, 2470141678989 is an apocalyptic number.
It is an amenable number.
470141678989 is a deficient number, since it is larger than the sum of its proper divisors (1).
470141678989 is an equidigital number, since it uses as much as digits as its factorization.
470141678989 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24385536, while the sum is 64.
The spelling of 470141678989 in words is "four hundred seventy billion, one hundred forty-one million, six hundred seventy-eight thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •