Base | Representation |
---|---|
bin | 1011001110010… |
… | …1011100010100 |
3 | 10021120202200210 |
4 | 2303211130110 |
5 | 44022432030 |
6 | 4401005420 |
7 | 1111102065 |
oct | 263453424 |
9 | 107522623 |
10 | 47077140 |
11 | 24634830 |
12 | 13923870 |
13 | 99a3bc6 |
14 | 637656c |
15 | 41edbb0 |
hex | 2ce5714 |
47077140 has 48 divisors (see below), whose sum is σ = 143801280. Its totient is φ = 11412480.
The previous prime is 47077087. The next prime is 47077153. The reversal of 47077140 is 4177074.
47077140 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×470771402 = 4432514221159200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 47077098 and 47077107.
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 15 ways as a sum of consecutive naturals, for example, 35005 + ... + 36324.
It is an arithmetic number, because the mean of its divisors is an integer number (2995860).
Almost surely, 247077140 is an apocalyptic number.
It is an amenable number.
47077140 is an abundant number, since it is smaller than the sum of its proper divisors (96724140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
47077140 is a wasteful number, since it uses less digits than its factorization.
47077140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71352 (or 71350 counting only the distinct ones).
The product of its (nonzero) digits is 5488, while the sum is 30.
The square root of 47077140 is about 6861.2783065548. The cubic root of 47077140 is about 361.0799361560.
The spelling of 47077140 in words is "forty-seven million, seventy-seven thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •