Base | Representation |
---|---|
bin | 110000111100110… |
… | …0100110110001001 |
3 | 11020110121210012201 |
4 | 1201321210312021 |
5 | 11330433424311 |
6 | 430552040201 |
7 | 55462606261 |
oct | 14171446611 |
9 | 4213553181 |
10 | 1642483081 |
11 | 773158938 |
12 | 39a093061 |
13 | 20238b8a5 |
14 | 1181d27a1 |
15 | 992e19c1 |
hex | 61e64d89 |
1642483081 has 2 divisors, whose sum is σ = 1642483082. Its totient is φ = 1642483080.
The previous prime is 1642483043. The next prime is 1642483097. The reversal of 1642483081 is 1803842461.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1633453056 + 9030025 = 40416^2 + 3005^2 .
It is an emirp because it is prime and its reverse (1803842461) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1642483081 - 27 = 1642482953 is a prime.
It is a super-2 number, since 2×16424830812 = 5395501342742505122, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1642483081.
It is not a weakly prime, because it can be changed into another prime (1642486081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 821241540 + 821241541.
It is an arithmetic number, because the mean of its divisors is an integer number (821241541).
Almost surely, 21642483081 is an apocalyptic number.
It is an amenable number.
1642483081 is a deficient number, since it is larger than the sum of its proper divisors (1).
1642483081 is an equidigital number, since it uses as much as digits as its factorization.
1642483081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36864, while the sum is 37.
The square root of 1642483081 is about 40527.5595243533. The cubic root of 1642483081 is about 1179.8685770036.
The spelling of 1642483081 in words is "one billion, six hundred forty-two million, four hundred eighty-three thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •