Base | Representation |
---|---|
bin | 10000111110000… |
… | …110100010000100 |
3 | 201211202000202012 |
4 | 100332012202010 |
5 | 1040341341030 |
6 | 44130233352 |
7 | 10025016203 |
oct | 2076064204 |
9 | 654660665 |
10 | 284715140 |
11 | 136794776 |
12 | 7b425858 |
13 | 46ca88c8 |
14 | 29b5523a |
15 | 19ee0095 |
hex | 10f86884 |
284715140 has 12 divisors (see below), whose sum is σ = 597901836. Its totient is φ = 113886048.
The previous prime is 284715107. The next prime is 284715157. The reversal of 284715140 is 41517482.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 34316164 + 250398976 = 5858^2 + 15824^2 .
It is a junction number, because it is equal to n+sod(n) for n = 284715097 and 284715106.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7117859 + ... + 7117898.
It is an arithmetic number, because the mean of its divisors is an integer number (49825153).
Almost surely, 2284715140 is an apocalyptic number.
284715140 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
284715140 is an abundant number, since it is smaller than the sum of its proper divisors (313186696).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
284715140 is a wasteful number, since it uses less digits than its factorization.
284715140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14235766 (or 14235764 counting only the distinct ones).
The product of its (nonzero) digits is 8960, while the sum is 32.
The square root of 284715140 is about 16873.5040818438. The cubic root of 284715140 is about 657.8651097126.
The spelling of 284715140 in words is "two hundred eighty-four million, seven hundred fifteen thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •