Base | Representation |
---|---|
bin | 11100101011101… |
… | …110001110010000 |
3 | 1020112111200122010 |
4 | 130223232032100 |
5 | 1441143123233 |
6 | 115430142520 |
7 | 14632222110 |
oct | 3453561620 |
9 | 1215450563 |
10 | 481223568 |
11 | 227702431 |
12 | 1151b1a40 |
13 | 7890c897 |
14 | 47ca9040 |
15 | 2c3a9b63 |
hex | 1caee390 |
481223568 has 80 divisors (see below), whose sum is σ = 1424480256. Its totient is φ = 137132160.
The previous prime is 481223557. The next prime is 481223579. The reversal of 481223568 is 865322184.
It is an interprime number because it is at equal distance from previous prime (481223557) and next prime (481223579).
It is a super-2 number, since 2×4812235682 = 463152244797301248, which contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 143155 + ... + 146477.
Almost surely, 2481223568 is an apocalyptic number.
481223568 is a gapful number since it is divisible by the number (48) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 481223568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (712240128).
481223568 is an abundant number, since it is smaller than the sum of its proper divisors (943256688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
481223568 is a wasteful number, since it uses less digits than its factorization.
481223568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3772 (or 3766 counting only the distinct ones).
The product of its digits is 92160, while the sum is 39.
The square root of 481223568 is about 21936.8085190166. The cubic root of 481223568 is about 783.6382563408.
The spelling of 481223568 in words is "four hundred eighty-one million, two hundred twenty-three thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •