Base | Representation |
---|---|
bin | 1011001100010… |
… | …1111000000000 |
3 | 10021100012022220 |
4 | 2303011320000 |
5 | 44004312330 |
6 | 4354131040 |
7 | 1110023112 |
oct | 263057000 |
9 | 107305286 |
10 | 46947840 |
11 | 24556675 |
12 | 13880a80 |
13 | 995a0b4 |
14 | 63413b2 |
15 | 41c5710 |
hex | 2cc5e00 |
46947840 has 80 divisors (see below), whose sum is σ = 150110928. Its totient is φ = 12517376.
The previous prime is 46947821. The next prime is 46947847. The reversal of 46947840 is 4874964.
It is a tau number, because it is divible by the number of its divisors (80).
It is a junction number, because it is equal to n+sod(n) for n = 46947792 and 46947801.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (46947847) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4624 + ... + 10736.
Almost surely, 246947840 is an apocalyptic number.
46947840 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 46947840, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (75055464).
46947840 is an abundant number, since it is smaller than the sum of its proper divisors (103163088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
46947840 is an equidigital number, since it uses as much as digits as its factorization.
46947840 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6139 (or 6123 counting only the distinct ones).
The product of its (nonzero) digits is 193536, while the sum is 42.
The square root of 46947840 is about 6851.8493853849. The cubic root of 46947840 is about 360.7490576271.
The spelling of 46947840 in words is "forty-six million, nine hundred forty-seven thousand, eight hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •