Base | Representation |
---|---|
bin | 11100110010111… |
… | …110100000011001 |
3 | 1020200002022021122 |
4 | 130302332200121 |
5 | 1442140002043 |
6 | 115535015025 |
7 | 14654332331 |
oct | 3462764031 |
9 | 1220068248 |
10 | 483125273 |
11 | 228791194 |
12 | 11596a475 |
13 | 79127357 |
14 | 482420c1 |
15 | 2c633368 |
hex | 1ccbe819 |
483125273 has 4 divisors (see below), whose sum is σ = 483177780. Its totient is φ = 483072768.
The previous prime is 483125257. The next prime is 483125299. The reversal of 483125273 is 372521384.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 335915584 + 147209689 = 18328^2 + 12133^2 .
It is a cyclic number.
It is not a de Polignac number, because 483125273 - 24 = 483125257 is a prime.
It is a super-2 number, since 2×4831252732 = 466820058822649058, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (483125233) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8408 + ... + 32201.
It is an arithmetic number, because the mean of its divisors is an integer number (120794445).
Almost surely, 2483125273 is an apocalyptic number.
It is an amenable number.
483125273 is a deficient number, since it is larger than the sum of its proper divisors (52507).
483125273 is a wasteful number, since it uses less digits than its factorization.
483125273 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52506.
The product of its digits is 40320, while the sum is 35.
The square root of 483125273 is about 21980.1108504939. The cubic root of 483125273 is about 784.6691631977.
The spelling of 483125273 in words is "four hundred eighty-three million, one hundred twenty-five thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.263 sec. • engine limits •