Base | Representation |
---|---|
bin | 10010001111000011000111 |
3 | 22222212020121 |
4 | 102033003013 |
5 | 2210431411 |
6 | 250242411 |
7 | 55426351 |
oct | 22170307 |
9 | 8885217 |
10 | 4780231 |
11 | 2775505 |
12 | 1726407 |
13 | cb4a51 |
14 | 8c60d1 |
15 | 646571 |
hex | 48f0c7 |
4780231 has 8 divisors (see below), whose sum is σ = 5056128. Its totient is φ = 4512000.
The previous prime is 4780201. The next prime is 4780241. The reversal of 4780231 is 1320874.
4780231 = T273 + T274 + ... + T365.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4780231 - 25 = 4780199 is a prime.
It is a super-2 number, since 2×47802312 = 45701216826722, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4780196 and 4780205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4780201) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 610 + ... + 3151.
It is an arithmetic number, because the mean of its divisors is an integer number (632016).
Almost surely, 24780231 is an apocalyptic number.
4780231 is a gapful number since it is divisible by the number (41) formed by its first and last digit.
4780231 is a deficient number, since it is larger than the sum of its proper divisors (275897).
4780231 is a wasteful number, since it uses less digits than its factorization.
4780231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3833.
The product of its (nonzero) digits is 1344, while the sum is 25.
The square root of 4780231 is about 2186.3739387397. The cubic root of 4780231 is about 168.4546335675.
The spelling of 4780231 in words is "four million, seven hundred eighty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.159 sec. • engine limits •