Base | Representation |
---|---|
bin | 10101110000001111010110… |
… | …10101011000101000011110 |
3 | 20021101011122201020001110020 |
4 | 22320013223111120220132 |
5 | 22232230133222332410 |
6 | 245424003003453010 |
7 | 13035052300463100 |
oct | 1270075325305036 |
9 | 207334581201406 |
10 | 47836999027230 |
11 | 1427361492a966 |
12 | 544716a227166 |
13 | 2090018289a7a |
14 | bb5474867570 |
15 | 57e53ba0ca70 |
hex | 2b81eb558a1e |
47836999027230 has 48 divisors (see below), whose sum is σ = 133553091165840. Its totient is φ = 10934171205888.
The previous prime is 47836999027189. The next prime is 47836999027231. The reversal of 47836999027230 is 3272099963874.
47836999027230 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (47836999027231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 16271086635 + ... + 16271089574.
It is an arithmetic number, because the mean of its divisors is an integer number (2782356065955).
Almost surely, 247836999027230 is an apocalyptic number.
47836999027230 is an abundant number, since it is smaller than the sum of its proper divisors (85716092138610).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
47836999027230 is a wasteful number, since it uses less digits than its factorization.
47836999027230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32542176233 (or 32542176226 counting only the distinct ones).
The product of its (nonzero) digits is 246903552, while the sum is 69.
The spelling of 47836999027230 in words is "forty-seven trillion, eight hundred thirty-six billion, nine hundred ninety-nine million, twenty-seven thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •