Base | Representation |
---|---|
bin | 10101011001110011101111… |
… | …11110100100010101000000 |
3 | 20011122111020220021101100020 |
4 | 22230321313332210111000 |
5 | 22132113202204120000 |
6 | 244033535440253440 |
7 | 12625265624325315 |
oct | 1254716776442500 |
9 | 204574226241306 |
10 | 47066264520000 |
11 | 13aa6766341030 |
12 | 5341910911280 |
13 | 203543947372b |
14 | b8a03b18cd0c |
15 | 56947cb07ba0 |
hex | 2ace77fa4540 |
47066264520000 has 560 divisors, whose sum is σ = 172292637107712. Its totient is φ = 11239683840000.
The previous prime is 47066264519971. The next prime is 47066264520071. The reversal of 47066264520000 is 2546266074.
It is a super-2 number, since 2×470662645200002 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 88173909 + ... + 88706091.
Almost surely, 247066264520000 is an apocalyptic number.
47066264520000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 47066264520000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (86146318553856).
47066264520000 is an abundant number, since it is smaller than the sum of its proper divisors (125226372587712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
47066264520000 is a wasteful number, since it uses less digits than its factorization.
47066264520000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 532296 (or 532271 counting only the distinct ones).
The product of its (nonzero) digits is 483840, while the sum is 42.
The spelling of 47066264520000 in words is "forty-seven trillion, sixty-six billion, two hundred sixty-four million, five hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •