Base | Representation |
---|---|
bin | 101000100011110… |
… | …0110000000010001 |
3 | 10111211212011210122 |
4 | 1101013212000101 |
5 | 10241400221134 |
6 | 343013440025 |
7 | 45503562113 |
oct | 12107460021 |
9 | 3454764718 |
10 | 1360945169 |
11 | 639244281 |
12 | 31b940015 |
13 | 188c561cc |
14 | cca673b3 |
15 | 7e72d02e |
hex | 511e6011 |
1360945169 has 4 divisors (see below), whose sum is σ = 1361080896. Its totient is φ = 1360809444.
The previous prime is 1360945151. The next prime is 1360945171. The reversal of 1360945169 is 9615490631.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1360945169 is a prime.
It is a super-2 number, since 2×13609451692 = 3704343506048877122, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1360945189) 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 in 3 ways as a sum of consecutive naturals, for example, 51509 + ... + 73314.
It is an arithmetic number, because the mean of its divisors is an integer number (340270224).
Almost surely, 21360945169 is an apocalyptic number.
It is an amenable number.
1360945169 is a deficient number, since it is larger than the sum of its proper divisors (135727).
1360945169 is a wasteful number, since it uses less digits than its factorization.
1360945169 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135726.
The product of its (nonzero) digits is 174960, while the sum is 44.
The square root of 1360945169 is about 36890.9903499486. The cubic root of 1360945169 is about 1108.1882543301.
The spelling of 1360945169 in words is "one billion, three hundred sixty million, nine hundred forty-five thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •