Base | Representation |
---|---|
bin | 10101011011110010100100… |
… | …10110111111110000000101 |
3 | 20011220000000002111202100021 |
4 | 22231321102112333300011 |
5 | 22134222123313210214 |
6 | 244125120042015141 |
7 | 12633226126610512 |
oct | 1255712226776005 |
9 | 204800002452307 |
10 | 47134352866309 |
11 | 14022626448415 |
12 | 5352b534a74b1 |
13 | 203b99a837047 |
14 | b8d459d46309 |
15 | 56b1154a7924 |
hex | 2ade525bfc05 |
47134352866309 has 2 divisors, whose sum is σ = 47134352866310. Its totient is φ = 47134352866308.
The previous prime is 47134352866283. The next prime is 47134352866333. The reversal of 47134352866309 is 90366825343174.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 41125863573025 + 6008489293284 = 6412945^2 + 2451222^2 .
It is a cyclic number.
It is not a de Polignac number, because 47134352866309 - 217 = 47134352735237 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (47134352866339) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 23567176433154 + 23567176433155.
It is an arithmetic number, because the mean of its divisors is an integer number (23567176433155).
It is a 2-persistent number, because it is pandigital, and so is 2⋅47134352866309 = 94268705732618, but 3⋅47134352866309 = 141403058598927 is not.
Almost surely, 247134352866309 is an apocalyptic number.
It is an amenable number.
47134352866309 is a deficient number, since it is larger than the sum of its proper divisors (1).
47134352866309 is an equidigital number, since it uses as much as digits as its factorization.
47134352866309 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 78382080, while the sum is 61.
The spelling of 47134352866309 in words is "forty-seven trillion, one hundred thirty-four billion, three hundred fifty-two million, eight hundred sixty-six thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •