Base | Representation |
---|---|
bin | 11100101010111… |
… | …111000110010110 |
3 | 1020112010212212022 |
4 | 130222333012112 |
5 | 1441120434200 |
6 | 115422053142 |
7 | 14630456300 |
oct | 3452770626 |
9 | 1215125768 |
10 | 481030550 |
11 | 227590410 |
12 | 11511a1b2 |
13 | 78872a80 |
14 | 47c58970 |
15 | 2c36c885 |
hex | 1cabf196 |
481030550 has 144 divisors (see below), whose sum is σ = 1223640432. Its totient is φ = 138297600.
The previous prime is 481030547. The next prime is 481030553. The reversal of 481030550 is 55030184.
It is an interprime number because it is at equal distance from previous prime (481030547) and next prime (481030553).
It is a super-3 number, since 3×4810305503 (a number of 27 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (26).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (481030553) 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 71 ways as a sum of consecutive naturals, for example, 349664 + ... + 351036.
It is an arithmetic number, because the mean of its divisors is an integer number (8497503).
Almost surely, 2481030550 is an apocalyptic number.
481030550 is an abundant number, since it is smaller than the sum of its proper divisors (742609882).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
481030550 is a wasteful number, since it uses less digits than its factorization.
481030550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1423 (or 1411 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 26.
The square root of 481030550 is about 21932.4086684523. The cubic root of 481030550 is about 783.5334703145.
The spelling of 481030550 in words is "four hundred eighty-one million, thirty thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •