Base | Representation |
---|---|
bin | 101000101010110… |
… | …1100010011000101 |
3 | 10112002210221110222 |
4 | 1101111230103011 |
5 | 10243322002330 |
6 | 343224554125 |
7 | 45550154042 |
oct | 12125542305 |
9 | 3462727428 |
10 | 1364640965 |
11 | 640338a56 |
12 | 321022945 |
13 | 18994b47c |
14 | cd34a1c9 |
15 | 7ec0d0e5 |
hex | 5156c4c5 |
1364640965 has 8 divisors (see below), whose sum is σ = 1694037240. Its totient is φ = 1054067392.
The previous prime is 1364640961. The next prime is 1364640973. The reversal of 1364640965 is 5690464631.
It can be written as a sum of positive squares in 4 ways, for example, as 330439684 + 1034201281 = 18178^2 + 32159^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1364640965 - 22 = 1364640961 is a prime.
It is a super-2 number, since 2×13646409652 = 3724489926712262450, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1364640961) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4705514 + ... + 4705803.
It is an arithmetic number, because the mean of its divisors is an integer number (211754655).
Almost surely, 21364640965 is an apocalyptic number.
It is an amenable number.
1364640965 is a deficient number, since it is larger than the sum of its proper divisors (329396275).
1364640965 is an equidigital number, since it uses as much as digits as its factorization.
1364640965 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9411351.
The product of its (nonzero) digits is 466560, while the sum is 44.
The square root of 1364640965 is about 36941.0471562461. The cubic root of 1364640965 is about 1109.1904832735.
The spelling of 1364640965 in words is "one billion, three hundred sixty-four million, six hundred forty thousand, nine hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •