Base | Representation |
---|---|
bin | 100111111100110… |
… | …1000010010111111 |
3 | 10110102101211100112 |
4 | 1033321220102333 |
5 | 10221132213302 |
6 | 341003420235 |
7 | 45135060425 |
oct | 11771502277 |
9 | 3412354315 |
10 | 1340507327 |
11 | 628754aa5 |
12 | 314b2467b |
13 | 18494b703 |
14 | ca067115 |
15 | 7ca42552 |
hex | 4fe684bf |
1340507327 has 4 divisors (see below), whose sum is σ = 1371681960. Its totient is φ = 1309332696.
The previous prime is 1340507297. The next prime is 1340507347. The reversal of 1340507327 is 7237050431.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1340507327 - 210 = 1340506303 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1340507293 and 1340507302.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1340507347) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15587252 + ... + 15587337.
It is an arithmetic number, because the mean of its divisors is an integer number (342920490).
Almost surely, 21340507327 is an apocalyptic number.
1340507327 is a deficient number, since it is larger than the sum of its proper divisors (31174633).
1340507327 is an equidigital number, since it uses as much as digits as its factorization.
1340507327 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31174632.
The product of its (nonzero) digits is 17640, while the sum is 32.
The square root of 1340507327 is about 36612.9393384361. The cubic root of 1340507327 is about 1102.6128869074.
Adding to 1340507327 its reverse (7237050431), we get a palindrome (8577557758).
The spelling of 1340507327 in words is "one billion, three hundred forty million, five hundred seven thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •