Base | Representation |
---|---|
bin | 11101000111111… |
… | …100000001100101 |
3 | 1021001102110210222 |
4 | 131013330001211 |
5 | 2000041321013 |
6 | 120252454125 |
7 | 15052126331 |
oct | 3507740145 |
9 | 1231373728 |
10 | 488620133 |
11 | 2308a45a1 |
12 | 11777a345 |
13 | 7a2cc451 |
14 | 48c727c1 |
15 | 2cd6b508 |
hex | 1d1fc065 |
488620133 has 4 divisors (see below), whose sum is σ = 489317868. Its totient is φ = 487922400.
The previous prime is 488620127. The next prime is 488620141. The reversal of 488620133 is 331026884.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 440706049 + 47914084 = 20993^2 + 6922^2 .
It is a cyclic number.
It is not a de Polignac number, because 488620133 - 28 = 488619877 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 488620093 and 488620102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (488629133) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 347816 + ... + 349217.
It is an arithmetic number, because the mean of its divisors is an integer number (122329467).
Almost surely, 2488620133 is an apocalyptic number.
It is an amenable number.
488620133 is a deficient number, since it is larger than the sum of its proper divisors (697735).
488620133 is an equidigital number, since it uses as much as digits as its factorization.
488620133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 697734.
The product of its (nonzero) digits is 27648, while the sum is 35.
The square root of 488620133 is about 22104.7536290274. The cubic root of 488620133 is about 787.6327861415.
The spelling of 488620133 in words is "four hundred eighty-eight million, six hundred twenty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •