Base | Representation |
---|---|
bin | 11100101110110… |
… | …001001101110101 |
3 | 1020121000021020100 |
4 | 130232301031311 |
5 | 1441344203021 |
6 | 115455224313 |
7 | 14642056500 |
oct | 3456611565 |
9 | 1217007210 |
10 | 482022261 |
11 | 2280a8506 |
12 | 115518099 |
13 | 78b2c296 |
14 | 48036137 |
15 | 2c4b6626 |
hex | 1cbb1375 |
482022261 has 36 divisors (see below), whose sum is σ = 813271212. Its totient is φ = 274305024.
The previous prime is 482022259. The next prime is 482022263. The reversal of 482022261 is 162220284.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (482022259) and next prime (482022263).
It can be written as a sum of positive squares in 2 ways, for example, as 289340100 + 192682161 = 17010^2 + 13881^2 .
It is not a de Polignac number, because 482022261 - 21 = 482022259 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (482022263) 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 35 ways as a sum of consecutive naturals, for example, 111211 + ... + 115463.
It is an arithmetic number, because the mean of its divisors is an integer number (22590867).
Almost surely, 2482022261 is an apocalyptic number.
It is an amenable number.
482022261 is a deficient number, since it is larger than the sum of its proper divisors (331248951).
482022261 is a wasteful number, since it uses less digits than its factorization.
482022261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4530 (or 4520 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 27.
The square root of 482022261 is about 21955.0053746293. The cubic root of 482022261 is about 784.0715549061.
The spelling of 482022261 in words is "four hundred eighty-two million, twenty-two thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •