Base | Representation |
---|---|
bin | 10101101100111111100001… |
… | …11100101101011010110001 |
3 | 20020222111122212021002011122 |
4 | 22312133300330231122301 |
5 | 22223413132030303434 |
6 | 245300431313152025 |
7 | 13024022333143361 |
oct | 1266376074553261 |
9 | 206874585232148 |
10 | 47725424072369 |
11 | 1423026976496a |
12 | 542960bb5b615 |
13 | 20826466b5a14 |
14 | badccc42c9a1 |
15 | 57b6ab511c2e |
hex | 2b67f0f2d6b1 |
47725424072369 has 2 divisors, whose sum is σ = 47725424072370. Its totient is φ = 47725424072368.
The previous prime is 47725424072299. The next prime is 47725424072371. The reversal of 47725424072369 is 96327042452774.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 43431460965025 + 4293963107344 = 6590255^2 + 2072188^2 .
It is a cyclic number.
It is not a de Polignac number, because 47725424072369 - 28 = 47725424072113 is a prime.
It is a super-2 number, since 2×477254240723692 (a number of 28 digits) contains 22 as substring.
Together with 47725424072371, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (47725424072869) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 23862712036184 + 23862712036185.
It is an arithmetic number, because the mean of its divisors is an integer number (23862712036185).
Almost surely, 247725424072369 is an apocalyptic number.
It is an amenable number.
47725424072369 is a deficient number, since it is larger than the sum of its proper divisors (1).
47725424072369 is an equidigital number, since it uses as much as digits as its factorization.
47725424072369 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 142248960, while the sum is 62.
The spelling of 47725424072369 in words is "forty-seven trillion, seven hundred twenty-five billion, four hundred twenty-four million, seventy-two thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •