Base | Representation |
---|---|
bin | 100111111100100… |
… | …1110101111000011 |
3 | 10110102012111201202 |
4 | 1033321032233003 |
5 | 10221120341002 |
6 | 341001251415 |
7 | 45134143244 |
oct | 11771165703 |
9 | 3412174652 |
10 | 1340402627 |
11 | 628693373 |
12 | 314a93b6b |
13 | 184912b65 |
14 | ca03accb |
15 | 7ca21502 |
hex | 4fe4ebc3 |
1340402627 has 8 divisors (see below), whose sum is σ = 1381526160. Its totient is φ = 1299680640.
The previous prime is 1340402599. The next prime is 1340402647. The reversal of 1340402627 is 7262040431.
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 1340402627 - 222 = 1336208323 is a prime.
It is a super-2 number, since 2×13404026272 = 3593358404937002258, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1340402627.
It is not an unprimeable number, because it can be changed into a prime (1340402647) 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 7 ways as a sum of consecutive naturals, for example, 93602 + ... + 106967.
It is an arithmetic number, because the mean of its divisors is an integer number (172690770).
Almost surely, 21340402627 is an apocalyptic number.
1340402627 is a deficient number, since it is larger than the sum of its proper divisors (41123533).
1340402627 is a wasteful number, since it uses less digits than its factorization.
1340402627 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200773.
The product of its (nonzero) digits is 8064, while the sum is 29.
The square root of 1340402627 is about 36611.5094881377. The cubic root of 1340402627 is about 1102.5841797226.
The spelling of 1340402627 in words is "one billion, three hundred forty million, four hundred two thousand, six hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •