Base | Representation |
---|---|
bin | 10001100111001… |
… | …11001100111000 |
3 | 101022000100122211 |
4 | 20303213030320 |
5 | 300310411030 |
6 | 22354424504 |
7 | 3442556065 |
oct | 1063471470 |
9 | 338010584 |
10 | 147747640 |
11 | 76443a97 |
12 | 41592134 |
13 | 247c0951 |
14 | 1589dc6c |
15 | ce8712a |
hex | 8ce7338 |
147747640 has 16 divisors (see below), whose sum is σ = 332432280. Its totient is φ = 59099040.
The previous prime is 147747631. The next prime is 147747659. The reversal of 147747640 is 46747741.
147747640 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (40), and also a Moran number because the ratio is a prime number: 3693691 = 147747640 / (1 + 4 + 7 + 7 + 4 + 7 + 6 + 4 + 0).
It is a junction number, because it is equal to n+sod(n) for n = 147747593 and 147747602.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1846806 + ... + 1846885.
Almost surely, 2147747640 is an apocalyptic number.
147747640 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
147747640 is an abundant number, since it is smaller than the sum of its proper divisors (184684640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
147747640 is a wasteful number, since it uses less digits than its factorization.
147747640 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3693702 (or 3693698 counting only the distinct ones).
The product of its (nonzero) digits is 131712, while the sum is 40.
The square root of 147747640 is about 12155.1487033273. The cubic root of 147747640 is about 528.6564283632.
The spelling of 147747640 in words is "one hundred forty-seven million, seven hundred forty-seven thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •