Base | Representation |
---|---|
bin | 101011111100011111… |
… | …001111110111100100 |
3 | 11111210110021002010220 |
4 | 223330133033313210 |
5 | 1233114021112402 |
6 | 33402105444340 |
7 | 3260210012052 |
oct | 537437176744 |
9 | 144713232126 |
10 | 47185722852 |
11 | 19014123a74 |
12 | 918a4a06b0 |
13 | 45ac9b4188 |
14 | 23d8a711d2 |
15 | 1362789dbc |
hex | afc7cfde4 |
47185722852 has 96 divisors (see below), whose sum is σ = 120660664320. Its totient is φ = 14287311360.
The previous prime is 47185722817. The next prime is 47185722853. The reversal of 47185722852 is 25822758174.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a junction number, because it is equal to n+sod(n) for n = 47185722795 and 47185722804.
It is not an unprimeable number, because it can be changed into a prime (47185722853) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2386953 + ... + 2406639.
It is an arithmetic number, because the mean of its divisors is an integer number (1256881920).
Almost surely, 247185722852 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 47185722852, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (60330332160).
47185722852 is an abundant number, since it is smaller than the sum of its proper divisors (73474941468).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
47185722852 is a wasteful number, since it uses less digits than its factorization.
47185722852 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20121 (or 20119 counting only the distinct ones).
The product of its digits is 2508800, while the sum is 51.
The spelling of 47185722852 in words is "forty-seven billion, one hundred eighty-five million, seven hundred twenty-two thousand, eight hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •