Base | Representation |
---|---|
bin | 101000100011100… |
… | …0010100101100101 |
3 | 10111211120210210202 |
4 | 1101013002211211 |
5 | 10241331100401 |
6 | 343010400245 |
7 | 45502416143 |
oct | 12107024545 |
9 | 3454523722 |
10 | 1360800101 |
11 | 639155291 |
12 | 31b890085 |
13 | 188c0517b |
14 | cca2a593 |
15 | 7e70006b |
hex | 511c2965 |
1360800101 has 2 divisors, whose sum is σ = 1360800102. Its totient is φ = 1360800100.
The previous prime is 1360800079. The next prime is 1360800107. The reversal of 1360800101 is 1010080631.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 829497601 + 531302500 = 28801^2 + 23050^2 .
It is a cyclic number.
It is not a de Polignac number, because 1360800101 - 218 = 1360537957 is a prime.
It is a super-2 number, since 2×13608001012 = 3703553829763220402, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1360800107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 680400050 + 680400051.
It is an arithmetic number, because the mean of its divisors is an integer number (680400051).
Almost surely, 21360800101 is an apocalyptic number.
It is an amenable number.
1360800101 is a deficient number, since it is larger than the sum of its proper divisors (1).
1360800101 is an equidigital number, since it uses as much as digits as its factorization.
1360800101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 20.
The square root of 1360800101 is about 36889.0241264255. The cubic root of 1360800101 is about 1108.1488776847.
Adding to 1360800101 its reverse (1010080631), we get a palindrome (2370880732).
The spelling of 1360800101 in words is "one billion, three hundred sixty million, eight hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •