Base | Representation |
---|---|
bin | 101011100010110… |
… | …1100111010111011 |
3 | 10202211100012120001 |
4 | 1113011230322323 |
5 | 10443021100012 |
6 | 400552413431 |
7 | 51131152141 |
oct | 12705547273 |
9 | 3684305501 |
10 | 1461112507 |
11 | 68a83a4a8 |
12 | 3493a7277 |
13 | 1a3927c1a |
14 | dc09d591 |
15 | 88417357 |
hex | 5716cebb |
1461112507 has 2 divisors, whose sum is σ = 1461112508. Its totient is φ = 1461112506.
The previous prime is 1461112463. The next prime is 1461112571. The reversal of 1461112507 is 7052111641.
It is a weak prime.
It is an emirp because it is prime and its reverse (7052111641) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1461112507 is a prime.
It is a super-2 number, since 2×14611125072 = 4269699516223650098, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1461116507) 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, 730556253 + 730556254.
It is an arithmetic number, because the mean of its divisors is an integer number (730556254).
Almost surely, 21461112507 is an apocalyptic number.
1461112507 is a deficient number, since it is larger than the sum of its proper divisors (1).
1461112507 is an equidigital number, since it uses as much as digits as its factorization.
1461112507 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1680, while the sum is 28.
The square root of 1461112507 is about 38224.5013963557. The cubic root of 1461112507 is about 1134.7352671012.
The spelling of 1461112507 in words is "one billion, four hundred sixty-one million, one hundred twelve thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •