Base | Representation |
---|---|
bin | 11100101001100… |
… | …111001011111001 |
3 | 1020111110120220112 |
4 | 130221213023321 |
5 | 1441022423312 |
6 | 115410234105 |
7 | 14624426411 |
oct | 3451471371 |
9 | 1214416815 |
10 | 480670457 |
11 | 227364913 |
12 | 114b85935 |
13 | 78777bb7 |
14 | 47ba3641 |
15 | 2c2ead22 |
hex | 1ca672f9 |
480670457 has 8 divisors (see below), whose sum is σ = 493070976. Its totient is φ = 468360592.
The previous prime is 480670439. The next prime is 480670483. The reversal of 480670457 is 754076084.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 480670457 - 226 = 413561593 is a prime.
It is a super-3 number, since 3×4806704573 (a number of 27 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (480670357) 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, 11858 + ... + 33195.
It is an arithmetic number, because the mean of its divisors is an integer number (61633872).
Almost surely, 2480670457 is an apocalyptic number.
480670457 is a gapful number since it is divisible by the number (47) formed by its first and last digit.
It is an amenable number.
480670457 is a deficient number, since it is larger than the sum of its proper divisors (12400519).
480670457 is a wasteful number, since it uses less digits than its factorization.
480670457 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45327.
The product of its (nonzero) digits is 188160, while the sum is 41.
The square root of 480670457 is about 21924.1979784894. The cubic root of 480670457 is about 783.3379073019.
The spelling of 480670457 in words is "four hundred eighty million, six hundred seventy thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •