Base | Representation |
---|---|
bin | 11100111100000… |
… | …101000000101101 |
3 | 1020211120112011210 |
4 | 130330011000231 |
5 | 1443242324323 |
6 | 120102105033 |
7 | 15013530405 |
oct | 3474050055 |
9 | 1224515153 |
10 | 485511213 |
11 | 22a070840 |
12 | 11671b179 |
13 | 79781355 |
14 | 486a3805 |
15 | 2c955293 |
hex | 1cf0502d |
485511213 has 8 divisors (see below), whose sum is σ = 706198176. Its totient is φ = 294249200.
The previous prime is 485511137. The next prime is 485511263. The reversal of 485511213 is 312115584.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 485511213 - 216 = 485445677 is a prime.
It is a super-3 number, since 3×4855112133 (a number of 27 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (485511263) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7356198 + ... + 7356263.
It is an arithmetic number, because the mean of its divisors is an integer number (88274772).
Almost surely, 2485511213 is an apocalyptic number.
It is an amenable number.
485511213 is a deficient number, since it is larger than the sum of its proper divisors (220686963).
485511213 is a wasteful number, since it uses less digits than its factorization.
485511213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14712475.
The product of its digits is 4800, while the sum is 30.
The square root of 485511213 is about 22034.3189819881. The cubic root of 485511213 is about 785.9587528291.
Adding to 485511213 its reverse (312115584), we get a palindrome (797626797).
The spelling of 485511213 in words is "four hundred eighty-five million, five hundred eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •