Base | Representation |
---|---|
bin | 11100001100011… |
… | …001111000000000 |
3 | 1012222001120220011 |
4 | 130030121320000 |
5 | 1432042420020 |
6 | 114534154304 |
7 | 14502356602 |
oct | 3414317000 |
9 | 1188046804 |
10 | 473013760 |
11 | 22300526a |
12 | 1124b2994 |
13 | 76cc6acb |
14 | 46b6d172 |
15 | 2b7d735a |
hex | 1c319e00 |
473013760 has 80 divisors (see below), whose sum is σ = 1160769456. Its totient is φ = 184762368.
The previous prime is 473013731. The next prime is 473013773. The reversal of 473013760 is 67310374.
It is a tau number, because it is divible by the number of its divisors (80).
It is a zygodrome in base 2.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 107932 + ... + 112228.
Almost surely, 2473013760 is an apocalyptic number.
473013760 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 473013760, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (580384728).
473013760 is an abundant number, since it is smaller than the sum of its proper divisors (687755696).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
473013760 is an equidigital number, since it uses as much as digits as its factorization.
473013760 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4363 (or 4347 counting only the distinct ones).
The product of its (nonzero) digits is 10584, while the sum is 31.
The square root of 473013760 is about 21748.8795113679. The cubic root of 473013760 is about 779.1563088725.
The spelling of 473013760 in words is "four hundred seventy-three million, thirteen thousand, seven hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.244 sec. • engine limits •