Base | Representation |
---|---|
bin | 101001100001010… |
… | …1100101000111101 |
3 | 10121002120201010212 |
4 | 1103002230220331 |
5 | 10323130403221 |
6 | 350125242205 |
7 | 46345066256 |
oct | 12302545075 |
9 | 3532521125 |
10 | 1393216061 |
11 | 655485936 |
12 | 32a703365 |
13 | 192844a03 |
14 | d3067b2d |
15 | 824a4b5b |
hex | 530aca3d |
1393216061 has 2 divisors, whose sum is σ = 1393216062. Its totient is φ = 1393216060.
The previous prime is 1393216049. The next prime is 1393216063. The reversal of 1393216061 is 1606123931.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1024384036 + 368832025 = 32006^2 + 19205^2 .
It is a cyclic number.
It is not a de Polignac number, because 1393216061 - 26 = 1393215997 is a prime.
Together with 1393216063, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1393216063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 696608030 + 696608031.
It is an arithmetic number, because the mean of its divisors is an integer number (696608031).
Almost surely, 21393216061 is an apocalyptic number.
It is an amenable number.
1393216061 is a deficient number, since it is larger than the sum of its proper divisors (1).
1393216061 is an equidigital number, since it uses as much as digits as its factorization.
1393216061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832, while the sum is 32.
The square root of 1393216061 is about 37325.8095826467. The cubic root of 1393216061 is about 1116.8790828502.
Adding to 1393216061 its reverse (1606123931), we get a palindrome (2999339992).
The spelling of 1393216061 in words is "one billion, three hundred ninety-three million, two hundred sixteen thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •