Base | Representation |
---|---|
bin | 1011010111001… |
… | …0010101100000 |
3 | 10022200002022212 |
4 | 2311302111200 |
5 | 44144413430 |
6 | 4421221252 |
7 | 1116024434 |
oct | 265622540 |
9 | 108602285 |
10 | 47654240 |
11 | 24999377 |
12 | 13b61828 |
13 | 9b4679a |
14 | 64869c4 |
15 | 42b4b95 |
hex | 2d72560 |
47654240 has 48 divisors (see below), whose sum is σ = 114996672. Its totient is φ = 18653184.
The previous prime is 47654239. The next prime is 47654251. The reversal of 47654240 is 4245674.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a junction number, because it is equal to n+sod(n) for n = 47654197 and 47654206.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4352 + ... + 10688.
It is an arithmetic number, because the mean of its divisors is an integer number (2395764).
Almost surely, 247654240 is an apocalyptic number.
47654240 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 47654240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (57498336).
47654240 is an abundant number, since it is smaller than the sum of its proper divisors (67342432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
47654240 is a wasteful number, since it uses less digits than its factorization.
47654240 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6399 (or 6391 counting only the distinct ones).
The product of its (nonzero) digits is 26880, while the sum is 32.
The square root of 47654240 is about 6903.2050527273. The cubic root of 47654240 is about 362.5493931903.
The spelling of 47654240 in words is "forty-seven million, six hundred fifty-four thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •