Base | Representation |
---|---|
bin | 11100101101011… |
… | …100000001110000 |
3 | 1020120100112120220 |
4 | 130231130001300 |
5 | 1441302021303 |
6 | 115443533040 |
7 | 14636104263 |
oct | 3455340160 |
9 | 1216315526 |
10 | 481673328 |
11 | 22798a334 |
12 | 11538a180 |
13 | 78a39506 |
14 | 47d84cda |
15 | 2c448053 |
hex | 1cb5c070 |
481673328 has 40 divisors (see below), whose sum is σ = 1267807248. Its totient is φ = 157527552.
The previous prime is 481673327. The next prime is 481673329. The reversal of 481673328 is 823376184.
It is an interprime number because it is at equal distance from previous prime (481673327) and next prime (481673329).
It is a self number, because there is not a number n which added to its sum of digits gives 481673328.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (481673321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 92125 + ... + 97212.
Almost surely, 2481673328 is an apocalyptic number.
481673328 is a gapful number since it is divisible by the number (48) formed by its first and last digit.
It is an amenable number.
481673328 is an abundant number, since it is smaller than the sum of its proper divisors (786133920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
481673328 is a wasteful number, since it uses less digits than its factorization.
481673328 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 189401 (or 189395 counting only the distinct ones).
The product of its digits is 193536, while the sum is 42.
The square root of 481673328 is about 21947.0573881785. The cubic root of 481673328 is about 783.8823143496.
The spelling of 481673328 in words is "four hundred eighty-one million, six hundred seventy-three thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •