Base | Representation |
---|---|
bin | 11011011111110… |
… | …101011010100001 |
3 | 1012011001222220022 |
4 | 123133311122201 |
5 | 1421100030311 |
6 | 113435523225 |
7 | 14301145442 |
oct | 3337653241 |
9 | 1164058808 |
10 | 461330081 |
11 | 217455133 |
12 | 10a5b9515 |
13 | 74765aa4 |
14 | 453ab2c9 |
15 | 2a77a5db |
hex | 1b7f56a1 |
461330081 has 2 divisors, whose sum is σ = 461330082. Its totient is φ = 461330080.
The previous prime is 461330063. The next prime is 461330083. The reversal of 461330081 is 180033164.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 412902400 + 48427681 = 20320^2 + 6959^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-461330081 is a prime.
It is a super-2 number, since 2×4613300812 = 425650887270933122, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 461330083, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 461330081.
It is not a weakly prime, because it can be changed into another prime (461330083) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 230665040 + 230665041.
It is an arithmetic number, because the mean of its divisors is an integer number (230665041).
Almost surely, 2461330081 is an apocalyptic number.
It is an amenable number.
461330081 is a deficient number, since it is larger than the sum of its proper divisors (1).
461330081 is an equidigital number, since it uses as much as digits as its factorization.
461330081 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 26.
The square root of 461330081 is about 21478.5958805505. The cubic root of 461330081 is about 772.6875675566.
The spelling of 461330081 in words is "four hundred sixty-one million, three hundred thirty thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •