Base | Representation |
---|---|
bin | 110010000111000… |
… | …1111111110010111 |
3 | 11100011221212102221 |
4 | 1210032033332113 |
5 | 11420423111142 |
6 | 434503243211 |
7 | 56445102064 |
oct | 14416177627 |
9 | 4304855387 |
10 | 1681457047 |
11 | 793158626 |
12 | 3ab149507 |
13 | 20a4863ca |
14 | 11d459c6b |
15 | 9c93e767 |
hex | 6438ff97 |
1681457047 has 2 divisors, whose sum is σ = 1681457048. Its totient is φ = 1681457046.
The previous prime is 1681457039. The next prime is 1681457051. The reversal of 1681457047 is 7407541861.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1681457047 - 23 = 1681457039 is a prime.
It is a super-3 number, since 3×16814570473 (a number of 29 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1681456994 and 1681457012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1681457087) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 840728523 + 840728524.
It is an arithmetic number, because the mean of its divisors is an integer number (840728524).
Almost surely, 21681457047 is an apocalyptic number.
1681457047 is a deficient number, since it is larger than the sum of its proper divisors (1).
1681457047 is an equidigital number, since it uses as much as digits as its factorization.
1681457047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 188160, while the sum is 43.
The square root of 1681457047 is about 41005.5733650927. The cubic root of 1681457047 is about 1189.1279648031.
The spelling of 1681457047 in words is "one billion, six hundred eighty-one million, four hundred fifty-seven thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •