Base | Representation |
---|---|
bin | 11100101010111… |
… | …010111110001001 |
3 | 1020112010000200001 |
4 | 130222322332021 |
5 | 1441114414031 |
6 | 115421443001 |
7 | 14630356063 |
oct | 3452727611 |
9 | 1215100601 |
10 | 481013641 |
11 | 227579739 |
12 | 115110461 |
13 | 78868174 |
14 | 47c52733 |
15 | 2c367861 |
hex | 1cabaf89 |
481013641 has 4 divisors (see below), whose sum is σ = 481646484. Its totient is φ = 480380800.
The previous prime is 481013629. The next prime is 481013647. The reversal of 481013641 is 146310184.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 204490000 + 276523641 = 14300^2 + 16629^2 .
It is a cyclic number.
It is not a de Polignac number, because 481013641 - 213 = 481005449 is a prime.
It is a super-3 number, since 3×4810136413 (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 (481013647) 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 3 ways as a sum of consecutive naturals, for example, 315280 + ... + 316801.
It is an arithmetic number, because the mean of its divisors is an integer number (120411621).
Almost surely, 2481013641 is an apocalyptic number.
It is an amenable number.
481013641 is a deficient number, since it is larger than the sum of its proper divisors (632843).
481013641 is an equidigital number, since it uses as much as digits as its factorization.
481013641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 632842.
The product of its (nonzero) digits is 2304, while the sum is 28.
The square root of 481013641 is about 21932.0231852878. The cubic root of 481013641 is about 783.5242893850.
The spelling of 481013641 in words is "four hundred eighty-one million, thirteen thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •