Base | Representation |
---|---|
bin | 11100101011010… |
… | …001000010100101 |
3 | 1020112021121200001 |
4 | 130223101002211 |
5 | 1441130312122 |
6 | 115423421301 |
7 | 14631213451 |
oct | 3453210245 |
9 | 1215247601 |
10 | 481104037 |
11 | 227630647 |
12 | 115154831 |
13 | 7889a35b |
14 | 47c77661 |
15 | 2c384527 |
hex | 1cad10a5 |
481104037 has 2 divisors, whose sum is σ = 481104038. Its totient is φ = 481104036.
The previous prime is 481103989. The next prime is 481104061. The reversal of 481104037 is 730401184.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 310252996 + 170851041 = 17614^2 + 13071^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-481104037 is a prime.
It is a super-2 number, since 2×4811040372 = 462922188835394738, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 481103996 and 481104014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (481104937) 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 as a sum of consecutive naturals, namely, 240552018 + 240552019.
It is an arithmetic number, because the mean of its divisors is an integer number (240552019).
Almost surely, 2481104037 is an apocalyptic number.
It is an amenable number.
481104037 is a deficient number, since it is larger than the sum of its proper divisors (1).
481104037 is an equidigital number, since it uses as much as digits as its factorization.
481104037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2688, while the sum is 28.
The square root of 481104037 is about 21934.0839106629. The cubic root of 481104037 is about 783.5733683987.
The spelling of 481104037 in words is "four hundred eighty-one million, one hundred four thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •