Base | Representation |
---|---|
bin | 10101100010010110111011… |
… | …10011100010011000010000 |
3 | 20012200120111222010120001022 |
4 | 22301023131303202120100 |
5 | 22201421320323234332 |
6 | 244420521524455012 |
7 | 12655435465436030 |
oct | 1261133563423020 |
9 | 205616458116038 |
10 | 47360030680592 |
11 | 140aa304711533 |
12 | 538a83654a468 |
13 | 2057054931866 |
14 | b9a3484118c0 |
15 | 571e22d8d212 |
hex | 2b12ddce2610 |
47360030680592 has 80 divisors (see below), whose sum is σ = 106213754979840. Its totient is φ = 20036896528896.
The previous prime is 47360030680559. The next prime is 47360030680621. The reversal of 47360030680592 is 29508603006374.
It is a happy number.
It is a super-3 number, since 3×473600306805923 (a number of 42 digits) contains 333 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 53114798 + ... + 53999090.
It is an arithmetic number, because the mean of its divisors is an integer number (1327671937248).
Almost surely, 247360030680592 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 47360030680592, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (53106877489920).
47360030680592 is an abundant number, since it is smaller than the sum of its proper divisors (58853724299248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
47360030680592 is a wasteful number, since it uses less digits than its factorization.
47360030680592 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 890440 (or 890434 counting only the distinct ones).
The product of its (nonzero) digits is 6531840, while the sum is 53.
The spelling of 47360030680592 in words is "forty-seven trillion, three hundred sixty billion, thirty million, six hundred eighty thousand, five hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •