Base | Representation |
---|---|
bin | 1101101110110011000… |
… | …10111100000100001100 |
3 | 1200002210122021210102121 |
4 | 12313121202330010030 |
5 | 30212222110000220 |
6 | 1000424214102324 |
7 | 46041450312400 |
oct | 6673142740414 |
9 | 1602718253377 |
10 | 471801250060 |
11 | 1720a9562288 |
12 | 7753134a9a4 |
13 | 3564bcc2a1a |
14 | 18b9a0d9100 |
15 | c41520ceaa |
hex | 6dd98bc10c |
471801250060 has 144 divisors (see below), whose sum is σ = 1222470627840. Its totient is φ = 152076113280.
The previous prime is 471801250057. The next prime is 471801250073. The reversal of 471801250060 is 60052108174.
It is a junction number, because it is equal to n+sod(n) for n = 471801249998 and 471801250025.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2342509 + ... + 2535931.
It is an arithmetic number, because the mean of its divisors is an integer number (8489379360).
Almost surely, 2471801250060 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 471801250060, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (611235313920).
471801250060 is an abundant number, since it is smaller than the sum of its proper divisors (750669377780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
471801250060 is a wasteful number, since it uses less digits than its factorization.
471801250060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 193596 (or 193587 counting only the distinct ones).
The product of its (nonzero) digits is 13440, while the sum is 34.
The spelling of 471801250060 in words is "four hundred seventy-one billion, eight hundred one million, two hundred fifty thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •