Base | Representation |
---|---|
bin | 101000101010000… |
… | …0100000101101001 |
3 | 10112002000020221221 |
4 | 1101110010011221 |
5 | 10243214322441 |
6 | 343211502041 |
7 | 45543425434 |
oct | 12124040551 |
9 | 3462006857 |
10 | 1364214121 |
11 | 640077296 |
12 | 320a57921 |
13 | 18982c0ba |
14 | cd27881b |
15 | 7eb768d1 |
hex | 51504169 |
1364214121 has 2 divisors, whose sum is σ = 1364214122. Its totient is φ = 1364214120.
The previous prime is 1364214109. The next prime is 1364214169. The reversal of 1364214121 is 1214124631.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 911375721 + 452838400 = 30189^2 + 21280^2 .
It is a cyclic number.
It is not a de Polignac number, because 1364214121 - 213 = 1364205929 is a prime.
It is a super-2 number, since 2×13642141212 = 3722160335871605282, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1364214101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 682107060 + 682107061.
It is an arithmetic number, because the mean of its divisors is an integer number (682107061).
Almost surely, 21364214121 is an apocalyptic number.
It is an amenable number.
1364214121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1364214121 is an equidigital number, since it uses as much as digits as its factorization.
1364214121 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1152, while the sum is 25.
The square root of 1364214121 is about 36935.2693370442. The cubic root of 1364214121 is about 1109.0748238713.
Adding to 1364214121 its reverse (1214124631), we get a palindrome (2578338752).
The spelling of 1364214121 in words is "one billion, three hundred sixty-four million, two hundred fourteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •