Base | Representation |
---|---|
bin | 10101101101101010101100… |
… | …10111111001000101101000 |
3 | 20021001201111001212021201110 |
4 | 22312311112113321011220 |
5 | 22224303113214031402 |
6 | 245315223153150320 |
7 | 13025502555621435 |
oct | 1266652627710550 |
9 | 207051431767643 |
10 | 47748600533352 |
11 | 1423a08221a054 |
12 | 5431bb985b3a0 |
13 | 208489b1a9c64 |
14 | bb108a532b8c |
15 | 57c0b607b56c |
hex | 2b6d565f9168 |
47748600533352 has 32 divisors (see below), whose sum is σ = 119971358136000. Its totient is φ = 15836219270784.
The previous prime is 47748600533351. The next prime is 47748600533353. The reversal of 47748600533352 is 25333500684774.
It is an interprime number because it is at equal distance from previous prime (47748600533351) and next prime (47748600533353).
It is a junction number, because it is equal to n+sod(n) for n = 47748600533292 and 47748600533301.
It is not an unprimeable number, because it can be changed into a prime (47748600533351) 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, 4998801813 + ... + 4998811364.
It is an arithmetic number, because the mean of its divisors is an integer number (3749104941750).
Almost surely, 247748600533352 is an apocalyptic number.
It is an amenable number.
47748600533352 is an abundant number, since it is smaller than the sum of its proper divisors (72222757602648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
47748600533352 is a wasteful number, since it uses less digits than its factorization.
47748600533352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9997613385 (or 9997613381 counting only the distinct ones).
The product of its (nonzero) digits is 50803200, while the sum is 57.
The spelling of 47748600533352 in words is "forty-seven trillion, seven hundred forty-eight billion, six hundred million, five hundred thirty-three thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •