Base | Representation |
---|---|
bin | 11100111011010… |
… | …111011111010001 |
3 | 1020211020001101212 |
4 | 130323113133101 |
5 | 1443220343003 |
6 | 120054105505 |
7 | 15012122654 |
oct | 3473273721 |
9 | 1224201355 |
10 | 485324753 |
11 | 229a53741 |
12 | 11664b295 |
13 | 79717514 |
14 | 4865589b |
15 | 2c919dd8 |
hex | 1ced77d1 |
485324753 has 2 divisors, whose sum is σ = 485324754. Its totient is φ = 485324752.
The previous prime is 485324713. The next prime is 485324759. The reversal of 485324753 is 357423584.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 275161744 + 210163009 = 16588^2 + 14497^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-485324753 is a prime.
It is a super-2 number, since 2×4853247532 = 471080231749022018, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 485324753.
It is not a weakly prime, because it can be changed into another prime (485324759) 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 as a sum of consecutive naturals, namely, 242662376 + 242662377.
It is an arithmetic number, because the mean of its divisors is an integer number (242662377).
Almost surely, 2485324753 is an apocalyptic number.
It is an amenable number.
485324753 is a deficient number, since it is larger than the sum of its proper divisors (1).
485324753 is an equidigital number, since it uses as much as digits as its factorization.
485324753 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 403200, while the sum is 41.
The square root of 485324753 is about 22030.0874487597. The cubic root of 485324753 is about 785.8581244399.
The spelling of 485324753 in words is "four hundred eighty-five million, three hundred twenty-four thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •