Base | Representation |
---|---|
bin | 11100111011001… |
… | …001101111101101 |
3 | 1020211010012011222 |
4 | 130323021233231 |
5 | 1443212042321 |
6 | 120052553125 |
7 | 15011466566 |
oct | 3473115755 |
9 | 1224105158 |
10 | 485268461 |
11 | 229a15417 |
12 | 1166227a5 |
13 | 796c7a02 |
14 | 4863d16d |
15 | 2c9083ab |
hex | 1cec9bed |
485268461 has 4 divisors (see below), whose sum is σ = 486012252. Its totient is φ = 484524672.
The previous prime is 485268439. The next prime is 485268473. The reversal of 485268461 is 164862584.
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 186186025 + 299082436 = 13645^2 + 17294^2 .
It is a cyclic number.
It is not a de Polignac number, because 485268461 - 222 = 481074157 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (485261461) 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 3 ways as a sum of consecutive naturals, for example, 370916 + ... + 372221.
It is an arithmetic number, because the mean of its divisors is an integer number (121503063).
Almost surely, 2485268461 is an apocalyptic number.
It is an amenable number.
485268461 is a deficient number, since it is larger than the sum of its proper divisors (743791).
485268461 is an equidigital number, since it uses as much as digits as its factorization.
485268461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 743790.
The product of its digits is 368640, while the sum is 44.
The square root of 485268461 is about 22028.8097953566. The cubic root of 485268461 is about 785.8277398121.
The spelling of 485268461 in words is "four hundred eighty-five million, two hundred sixty-eight thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •