Base | Representation |
---|---|
bin | 101011100010110… |
… | …1101111001011011 |
3 | 10202211100102001012 |
4 | 1113011231321123 |
5 | 10443021212012 |
6 | 400552444135 |
7 | 51131166614 |
oct | 12705557133 |
9 | 3684312035 |
10 | 1461116507 |
11 | 68a842504 |
12 | 3493a964b |
13 | 1a39299a6 |
14 | dc0a0c0b |
15 | 88418622 |
hex | 5716de5b |
1461116507 has 2 divisors, whose sum is σ = 1461116508. Its totient is φ = 1461116506.
The previous prime is 1461116497. The next prime is 1461116509. The reversal of 1461116507 is 7056111641.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1461116507 is a prime.
It is a super-2 number, since 2×14611165072 = 4269722894055762098, which contains 22 as substring.
Together with 1461116509, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1461116509) 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, 730558253 + 730558254.
It is an arithmetic number, because the mean of its divisors is an integer number (730558254).
Almost surely, 21461116507 is an apocalyptic number.
1461116507 is a deficient number, since it is larger than the sum of its proper divisors (1).
1461116507 is an equidigital number, since it uses as much as digits as its factorization.
1461116507 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5040, while the sum is 32.
The square root of 1461116507 is about 38224.5537187813. The cubic root of 1461116507 is about 1134.7363025991.
The spelling of 1461116507 in words is "one billion, four hundred sixty-one million, one hundred sixteen thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •