Base | Representation |
---|---|
bin | 11100111010001… |
… | …101011011100101 |
3 | 1020210122122022001 |
4 | 130322031123211 |
5 | 1443131141123 |
6 | 120043405301 |
7 | 15006420412 |
oct | 3472153345 |
9 | 1223578261 |
10 | 485021413 |
11 | 229866848 |
12 | 116523831 |
13 | 7963c426 |
14 | 485b7109 |
15 | 2c8aa0ad |
hex | 1ce8d6e5 |
485021413 has 2 divisors, whose sum is σ = 485021414. Its totient is φ = 485021412.
The previous prime is 485021387. The next prime is 485021429. The reversal of 485021413 is 314120584.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 302690404 + 182331009 = 17398^2 + 13503^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-485021413 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (485021473) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 242510706 + 242510707.
It is an arithmetic number, because the mean of its divisors is an integer number (242510707).
Almost surely, 2485021413 is an apocalyptic number.
It is an amenable number.
485021413 is a deficient number, since it is larger than the sum of its proper divisors (1).
485021413 is an equidigital number, since it uses as much as digits as its factorization.
485021413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3840, while the sum is 28.
The square root of 485021413 is about 22023.2016973010. The cubic root of 485021413 is about 785.6943633815.
Adding to 485021413 its reverse (314120584), we get a palindrome (799141997).
The spelling of 485021413 in words is "four hundred eighty-five million, twenty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.033 sec. • engine limits •