Base | Representation |
---|---|
bin | 101011100010111… |
… | …1001100111100001 |
3 | 10202211102211220012 |
4 | 1113011321213201 |
5 | 10443024231023 |
6 | 400553454305 |
7 | 51131456564 |
oct | 12705714741 |
9 | 3684384805 |
10 | 1461164513 |
11 | 68a875586 |
12 | 349411395 |
13 | 1a39457b3 |
14 | dc0b44db |
15 | 88427978 |
hex | 571799e1 |
1461164513 has 2 divisors, whose sum is σ = 1461164514. Its totient is φ = 1461164512.
The previous prime is 1461164491. The next prime is 1461164587. The reversal of 1461164513 is 3154611641.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1455651409 + 5513104 = 38153^2 + 2348^2 .
It is a cyclic number.
It is not a de Polignac number, because 1461164513 - 210 = 1461163489 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1461164513.
It is not a weakly prime, because it can be changed into another prime (1461164813) 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, 730582256 + 730582257.
It is an arithmetic number, because the mean of its divisors is an integer number (730582257).
Almost surely, 21461164513 is an apocalyptic number.
It is an amenable number.
1461164513 is a deficient number, since it is larger than the sum of its proper divisors (1).
1461164513 is an equidigital number, since it uses as much as digits as its factorization.
1461164513 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 8640, while the sum is 32.
The square root of 1461164513 is about 38225.1816607848. The cubic root of 1461164513 is about 1134.7487299801.
The spelling of 1461164513 in words is "one billion, four hundred sixty-one million, one hundred sixty-four thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •