Base | Representation |
---|---|
bin | 10101011001010001111110… |
… | …11011100101101111010001 |
3 | 20011120202110111011222122220 |
4 | 22230220333123211233101 |
5 | 22131314040301114312 |
6 | 244021340522251253 |
7 | 12624054445150305 |
oct | 1254507733455721 |
9 | 204522414158586 |
10 | 47048135957457 |
11 | 13a9a003229738 |
12 | 533a2b1656b29 |
13 | 203380a70ba4b |
14 | b891db657d05 |
15 | 568c6b306c8c |
hex | 2aca3f6e5bd1 |
47048135957457 has 8 divisors (see below), whose sum is σ = 62733725196384. Its totient is φ = 31363985345088.
The previous prime is 47048135957393. The next prime is 47048135957461. The reversal of 47048135957457 is 75475953184074.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 47048135957457 - 26 = 47048135957393 is a prime.
It is a super-2 number, since 2×470481359574572 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 47048135957391 and 47048135957400.
It is not an unprimeable number, because it can be changed into a prime (47048135957057) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 359580328 + ... + 359711145.
It is an arithmetic number, because the mean of its divisors is an integer number (7841715649548).
Almost surely, 247048135957457 is an apocalyptic number.
It is an amenable number.
47048135957457 is a deficient number, since it is larger than the sum of its proper divisors (15685589238927).
47048135957457 is a wasteful number, since it uses less digits than its factorization.
47048135957457 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 719313279.
The product of its (nonzero) digits is 592704000, while the sum is 69.
The spelling of 47048135957457 in words is "forty-seven trillion, forty-eight billion, one hundred thirty-five million, nine hundred fifty-seven thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •