Base | Representation |
---|---|
bin | 1001111010100001… |
… | …0001001101111101 |
3 | 20212110210220200001 |
4 | 2132220101031331 |
5 | 20422301401123 |
6 | 1120030034301 |
7 | 122644104412 |
oct | 23650211575 |
9 | 6773726601 |
10 | 2661356413 |
11 | 11462a2511 |
12 | 623348991 |
13 | 3354a6411 |
14 | 1b3654109 |
15 | 1089a00ad |
hex | 9ea1137d |
2661356413 has 2 divisors, whose sum is σ = 2661356414. Its totient is φ = 2661356412.
The previous prime is 2661356359. The next prime is 2661356431. The reversal of 2661356413 is 3146531662.
Together with next prime (2661356431) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1518037444 + 1143318969 = 38962^2 + 33813^2 .
It is a cyclic number.
It is not a de Polignac number, because 2661356413 - 217 = 2661225341 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2661356713) 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, 1330678206 + 1330678207.
It is an arithmetic number, because the mean of its divisors is an integer number (1330678207).
Almost surely, 22661356413 is an apocalyptic number.
It is an amenable number.
2661356413 is a deficient number, since it is larger than the sum of its proper divisors (1).
2661356413 is an equidigital number, since it uses as much as digits as its factorization.
2661356413 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 77760, while the sum is 37.
The square root of 2661356413 is about 51588.3360169719. The cubic root of 2661356413 is about 1385.8014559636.
The spelling of 2661356413 in words is "two billion, six hundred sixty-one million, three hundred fifty-six thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •