Base | Representation |
---|---|
bin | 101011111011001101… |
… | …100000000000000000 |
3 | 11111201221221100002010 |
4 | 223323031200000000 |
5 | 1233043024334440 |
6 | 33400022252520 |
7 | 3256526606520 |
oct | 537315400000 |
9 | 144657840063 |
10 | 47164293120 |
11 | 1900301754a |
12 | 9183287140 |
13 | 45a8420069 |
14 | 23d5c93680 |
15 | 1360955580 |
hex | afb360000 |
47164293120 has 576 divisors, whose sum is σ = 181193241600. Its totient is φ = 10242490368.
The previous prime is 47164293107. The next prime is 47164293131. The reversal of 47164293120 is 2139246174.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 316538806 + ... + 316538954.
It is an arithmetic number, because the mean of its divisors is an integer number (314571600).
Almost surely, 247164293120 is an apocalyptic number.
47164293120 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 47164293120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (90596620800).
47164293120 is an abundant number, since it is smaller than the sum of its proper divisors (134028948480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
47164293120 is an equidigital number, since it uses as much as digits as its factorization.
47164293120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 221 (or 189 counting only the distinct ones).
The product of its (nonzero) digits is 72576, while the sum is 39.
The spelling of 47164293120 in words is "forty-seven billion, one hundred sixty-four million, two hundred ninety-three thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •