Base | Representation |
---|---|
bin | 101010000111001… |
… | …1101011010110101 |
3 | 10122110221201202122 |
4 | 1110032131122311 |
5 | 10343221423121 |
6 | 352115045325 |
7 | 50005645013 |
oct | 12416353265 |
9 | 3573851678 |
10 | 1413076661 |
11 | 665710457 |
12 | 3352a0845 |
13 | 1969a9849 |
14 | d59578b3 |
15 | 840c95ab |
hex | 5439d6b5 |
1413076661 has 2 divisors, whose sum is σ = 1413076662. Its totient is φ = 1413076660.
The previous prime is 1413076631. The next prime is 1413076681. The reversal of 1413076661 is 1666703141.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 745836100 + 667240561 = 27310^2 + 25831^2 .
It is an emirp because it is prime and its reverse (1666703141) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1413076661 - 26 = 1413076597 is a prime.
It is a super-3 number, since 3×14130766613 (a number of 28 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1413076631) 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, 706538330 + 706538331.
It is an arithmetic number, because the mean of its divisors is an integer number (706538331).
Almost surely, 21413076661 is an apocalyptic number.
It is an amenable number.
1413076661 is a deficient number, since it is larger than the sum of its proper divisors (1).
1413076661 is an equidigital number, since it uses as much as digits as its factorization.
1413076661 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18144, while the sum is 35.
The square root of 1413076661 is about 37590.9119469055. The cubic root of 1413076661 is about 1122.1611812656.
The spelling of 1413076661 in words is "one billion, four hundred thirteen million, seventy-six thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •