Base | Representation |
---|---|
bin | 101000100111000… |
… | …1010101001101101 |
3 | 10111222002201021102 |
4 | 1101032022221231 |
5 | 10242320340031 |
6 | 343114412445 |
7 | 45524326262 |
oct | 12116125155 |
9 | 3458081242 |
10 | 1362668141 |
11 | 63a21081a |
12 | 320431125 |
13 | 18940a513 |
14 | ccd95269 |
15 | 7e96d7cb |
hex | 5138aa6d |
1362668141 has 2 divisors, whose sum is σ = 1362668142. Its totient is φ = 1362668140.
The previous prime is 1362668129. The next prime is 1362668149. The reversal of 1362668141 is 1418662631.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 814874116 + 547794025 = 28546^2 + 23405^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1362668141 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1362668095 and 1362668104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1362668149) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 681334070 + 681334071.
It is an arithmetic number, because the mean of its divisors is an integer number (681334071).
Almost surely, 21362668141 is an apocalyptic number.
It is an amenable number.
1362668141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1362668141 is an equidigital number, since it uses as much as digits as its factorization.
1362668141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 41472, while the sum is 38.
The square root of 1362668141 is about 36914.3351694162. The cubic root of 1362668141 is about 1108.6557167423.
The spelling of 1362668141 in words is "one billion, three hundred sixty-two million, six hundred sixty-eight thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •