Base | Representation |
---|---|
bin | 101000101011011… |
… | …1010100010001011 |
3 | 10112010102020001122 |
4 | 1101112322202023 |
5 | 10243412231134 |
6 | 343235505455 |
7 | 45552660233 |
oct | 12126724213 |
9 | 3463366048 |
10 | 1364961419 |
11 | 640537798 |
12 | 32115828b |
13 | 189a312a3 |
14 | cd3d0cc3 |
15 | 7ec7302e |
hex | 515ba88b |
1364961419 has 2 divisors, whose sum is σ = 1364961420. Its totient is φ = 1364961418.
The previous prime is 1364961391. The next prime is 1364961421. The reversal of 1364961419 is 9141694631.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1364961419 - 28 = 1364961163 is a prime.
It is a super-2 number, since 2×13649614192 = 3726239350716987122, which contains 22 as substring.
Together with 1364961421, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1364961419.
It is not a weakly prime, because it can be changed into another prime (1364961469) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 682480709 + 682480710.
It is an arithmetic number, because the mean of its divisors is an integer number (682480710).
Almost surely, 21364961419 is an apocalyptic number.
1364961419 is a deficient number, since it is larger than the sum of its proper divisors (1).
1364961419 is an equidigital number, since it uses as much as digits as its factorization.
1364961419 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 139968, while the sum is 44.
The square root of 1364961419 is about 36945.3842719223. The cubic root of 1364961419 is about 1109.2772989555.
It can be divided in two parts, 13649 and 61419, that multiplied together give a triangular number (838307931 = T40946).
The spelling of 1364961419 in words is "one billion, three hundred sixty-four million, nine hundred sixty-one thousand, four hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •