Base | Representation |
---|---|
bin | 101100010010111000… |
… | …001111001110000000 |
3 | 11112202122010001122110 |
4 | 230102320033032000 |
5 | 1234401202410134 |
6 | 33503245135320 |
7 | 3302420665500 |
oct | 542270171600 |
9 | 145678101573 |
10 | 47561372544 |
11 | 19197178164 |
12 | 927425a540 |
13 | 463c77b1ba |
14 | 24328d7a00 |
15 | 138573d7e9 |
hex | b12e0f380 |
47561372544 has 384 divisors, whose sum is σ = 154092395520. Its totient is φ = 12943687680.
The previous prime is 47561372461. The next prime is 47561372561. The reversal of 47561372544 is 44527316574.
It is a tau number, because it is divible by the number of its divisors (384).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a junction number, because it is equal to n+sod(n) for n = 47561372493 and 47561372502.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 39080224 + ... + 39081440.
It is an arithmetic number, because the mean of its divisors is an integer number (401282280).
Almost surely, 247561372544 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 47561372544, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (77046197760).
47561372544 is an abundant number, since it is smaller than the sum of its proper divisors (106531022976).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
47561372544 is a wasteful number, since it uses less digits than its factorization.
47561372544 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1346 (or 1327 counting only the distinct ones).
The product of its digits is 2822400, while the sum is 48.
The spelling of 47561372544 in words is "forty-seven billion, five hundred sixty-one million, three hundred seventy-two thousand, five hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •