Base | Representation |
---|---|
bin | 11100110010111… |
… | …110100010100111 |
3 | 1020200002022110220 |
4 | 130302332202213 |
5 | 1442140003130 |
6 | 115535015423 |
7 | 14654332623 |
oct | 3462764247 |
9 | 1220068426 |
10 | 483125415 |
11 | 228791303 |
12 | 11596a573 |
13 | 79127436 |
14 | 48242183 |
15 | 2c633410 |
hex | 1ccbe8a7 |
483125415 has 8 divisors (see below), whose sum is σ = 773000688. Its totient is φ = 257666880.
The previous prime is 483125389. The next prime is 483125417. The reversal of 483125415 is 514521384.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 483125415 - 29 = 483124903 is a prime.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (483125417) 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 7 ways as a sum of consecutive naturals, for example, 16104166 + ... + 16104195.
It is an arithmetic number, because the mean of its divisors is an integer number (96625086).
Almost surely, 2483125415 is an apocalyptic number.
483125415 is a deficient number, since it is larger than the sum of its proper divisors (289875273).
483125415 is a wasteful number, since it uses less digits than its factorization.
483125415 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32208369.
The product of its digits is 19200, while the sum is 33.
The square root of 483125415 is about 21980.1140806867. The cubic root of 483125415 is about 784.6692400742.
Adding to 483125415 its reverse (514521384), we get a palindrome (997646799).
The spelling of 483125415 in words is "four hundred eighty-three million, one hundred twenty-five thousand, four hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •