Base | Representation |
---|---|
bin | 11100111110101… |
… | …101001011110101 |
3 | 1020212212112002101 |
4 | 130332231023311 |
5 | 1443431400203 |
6 | 120124542101 |
7 | 15022426603 |
oct | 3476551365 |
9 | 1225775071 |
10 | 486200053 |
11 | 22a4a1329 |
12 | 1169b1931 |
13 | 79962a51 |
14 | 48802873 |
15 | 2ca3e41d |
hex | 1cfad2f5 |
486200053 has 4 divisors (see below), whose sum is σ = 488092140. Its totient is φ = 484307968.
The previous prime is 486200047. The next prime is 486200087. The reversal of 486200053 is 350002684.
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 412617969 + 73582084 = 20313^2 + 8578^2 .
It is a cyclic number.
It is not a de Polignac number, because 486200053 - 213 = 486191861 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 486199994 and 486200030.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (486200093) 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, 945658 + ... + 946171.
It is an arithmetic number, because the mean of its divisors is an integer number (122023035).
Almost surely, 2486200053 is an apocalyptic number.
It is an amenable number.
486200053 is a deficient number, since it is larger than the sum of its proper divisors (1892087).
486200053 is a wasteful number, since it uses less digits than its factorization.
486200053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1892086.
The product of its (nonzero) digits is 5760, while the sum is 28.
The square root of 486200053 is about 22049.9445124018. The cubic root of 486200053 is about 786.3302814842.
The spelling of 486200053 in words is "four hundred eighty-six million, two hundred thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •