Base | Representation |
---|---|
bin | 11101011100111… |
… | …10111011011010 |
3 | 122012220021021211 |
4 | 32232132323122 |
5 | 1001222110310 |
6 | 40303253334 |
7 | 6060013000 |
oct | 1656367332 |
9 | 565807254 |
10 | 247066330 |
11 | 11750a655 |
12 | 6a8aa24a |
13 | 3c2562c4 |
14 | 24b54a70 |
15 | 16a54c8a |
hex | eb9eeda |
247066330 has 32 divisors (see below), whose sum is σ = 518630400. Its totient is φ = 84707280.
The previous prime is 247066327. The next prime is 247066333. The reversal of 247066330 is 33660742.
It is an interprime number because it is at equal distance from previous prime (247066327) and next prime (247066333).
It is a super-2 number, since 2×2470663302 = 122083542839337800, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 247066292 and 247066301.
It is not an unprimeable number, because it can be changed into a prime (247066333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 32586 + ... + 39445.
It is an arithmetic number, because the mean of its divisors is an integer number (16207200).
Almost surely, 2247066330 is an apocalyptic number.
247066330 is an abundant number, since it is smaller than the sum of its proper divisors (271564070).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
247066330 is an equidigital number, since it uses as much as digits as its factorization.
247066330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72059 (or 72045 counting only the distinct ones).
The product of its (nonzero) digits is 18144, while the sum is 31.
The square root of 247066330 is about 15718.3437422650. The cubic root of 247066330 is about 627.4866946381.
The spelling of 247066330 in words is "two hundred forty-seven million, sixty-six thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •