Base | Representation |
---|---|
bin | 11100110001010… |
… | …111111110111101 |
3 | 1020122021222020121 |
4 | 130301113332331 |
5 | 1442033032331 |
6 | 115522014541 |
7 | 14650633126 |
oct | 3461277675 |
9 | 1218258217 |
10 | 482705341 |
11 | 228524738 |
12 | 1157a7451 |
13 | 7900b181 |
14 | 4817304d |
15 | 2c59dc11 |
hex | 1cc57fbd |
482705341 has 12 divisors (see below), whose sum is σ = 500800860. Its totient is φ = 464985920.
The previous prime is 482705339. The next prime is 482705351. The reversal of 482705341 is 143507284.
It can be written as a sum of positive squares in 2 ways, for example, as 52142841 + 430562500 = 7221^2 + 20750^2 .
It is not a de Polignac number, because 482705341 - 21 = 482705339 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 482705297 and 482705306.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (482705351) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 281595 + ... + 283303.
It is an arithmetic number, because the mean of its divisors is an integer number (41733405).
Almost surely, 2482705341 is an apocalyptic number.
482705341 is a gapful number since it is divisible by the number (41) formed by its first and last digit.
It is an amenable number.
482705341 is a deficient number, since it is larger than the sum of its proper divisors (18095519).
482705341 is an equidigital number, since it uses as much as digits as its factorization.
482705341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1916 (or 1833 counting only the distinct ones).
The product of its (nonzero) digits is 26880, while the sum is 34.
The square root of 482705341 is about 21970.5562287349. The cubic root of 482705341 is about 784.4417527482.
The spelling of 482705341 in words is "four hundred eighty-two million, seven hundred five thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •