Base | Representation |
---|---|
bin | 11100110001011… |
… | …100101111101001 |
3 | 1020122022221222211 |
4 | 130301130233221 |
5 | 1442034143331 |
6 | 115522245121 |
7 | 14651044024 |
oct | 3461345751 |
9 | 1218287884 |
10 | 482724841 |
11 | 228538355 |
12 | 1157b67a1 |
13 | 79017001 |
14 | 4817a1bb |
15 | 2c5a48b1 |
hex | 1cc5cbe9 |
482724841 has 9 divisors (see below), whose sum is σ = 489384471. Its totient is φ = 476155512.
The previous prime is 482724833. The next prime is 482724881. The reversal of 482724841 is 148427284.
The square root of 482724841 is 21971.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 439112025 + 43612816 = 20955^2 + 6604^2 .
It is not a de Polignac number, because 482724841 - 23 = 482724833 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 482724794 and 482724803.
It is not an unprimeable number, because it can be changed into a prime (482724821) 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 in 8 ways as a sum of consecutive naturals, for example, 2790231 + ... + 2790403.
Almost surely, 2482724841 is an apocalyptic number.
482724841 is the 21971-st square number.
482724841 is the 10986-th centered octagonal number.
It is an amenable number.
482724841 is a deficient number, since it is larger than the sum of its proper divisors (6659630).
482724841 is an frugal number, since it uses more digits than its factorization.
482724841 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 600 (or 300 counting only the distinct ones).
The product of its digits is 114688, while the sum is 40.
The cubic root of 482724841 is about 784.4523157197.
The spelling of 482724841 in words is "four hundred eighty-two million, seven hundred twenty-four thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.059 sec. • engine limits •