Base | Representation |
---|---|
bin | 101011100011011… |
… | …0100110111100001 |
3 | 10202211220011210122 |
4 | 1113012310313201 |
5 | 10443110012301 |
6 | 401003010025 |
7 | 51133520252 |
oct | 12706646741 |
9 | 3684804718 |
10 | 1461407201 |
11 | 68aa20951 |
12 | 349509915 |
13 | 1a39cc0b7 |
14 | dc138b29 |
15 | 8847481b |
hex | 571b4de1 |
1461407201 has 2 divisors, whose sum is σ = 1461407202. Its totient is φ = 1461407200.
The previous prime is 1461407183. The next prime is 1461407231. The reversal of 1461407201 is 1027041641.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1140818176 + 320589025 = 33776^2 + 17905^2 .
It is a cyclic number.
It is not a de Polignac number, because 1461407201 - 218 = 1461145057 is a prime.
It is a super-2 number, since 2×14614072012 = 4271422014269308802, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1461407231) 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 as a sum of consecutive naturals, namely, 730703600 + 730703601.
It is an arithmetic number, because the mean of its divisors is an integer number (730703601).
Almost surely, 21461407201 is an apocalyptic number.
It is an amenable number.
1461407201 is a deficient number, since it is larger than the sum of its proper divisors (1).
1461407201 is an equidigital number, since it uses as much as digits as its factorization.
1461407201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1344, while the sum is 26.
The square root of 1461407201 is about 38228.3559808684. The cubic root of 1461407201 is about 1134.8115507991.
Adding to 1461407201 its reverse (1027041641), we get a palindrome (2488448842).
The spelling of 1461407201 in words is "one billion, four hundred sixty-one million, four hundred seven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •