Base | Representation |
---|---|
bin | 101000000111100… |
… | …1100101010110011 |
3 | 10110211001002012002 |
4 | 1100033030222303 |
5 | 10224104130311 |
6 | 341324524215 |
7 | 45234116414 |
oct | 12017145263 |
9 | 3424032162 |
10 | 1346161331 |
11 | 630966a29 |
12 | 3169b066b |
13 | 185b7b088 |
14 | caad980b |
15 | 7d2ac93b |
hex | 503ccab3 |
1346161331 has 4 divisors (see below), whose sum is σ = 1346731464. Its totient is φ = 1345591200.
The previous prime is 1346161321. The next prime is 1346161373. The reversal of 1346161331 is 1331616431.
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 1346161331 - 222 = 1341967027 is a prime.
It is a super-2 number, since 2×13461613312 = 3624300658159383122, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1346161294 and 1346161303.
It is not an unprimeable number, because it can be changed into a prime (1346161321) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 281510 + ... + 286251.
It is an arithmetic number, because the mean of its divisors is an integer number (336682866).
Almost surely, 21346161331 is an apocalyptic number.
1346161331 is a deficient number, since it is larger than the sum of its proper divisors (570133).
1346161331 is an equidigital number, since it uses as much as digits as its factorization.
1346161331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 570132.
The product of its digits is 3888, while the sum is 29.
The square root of 1346161331 is about 36690.0712863848. The cubic root of 1346161331 is about 1104.1609160680.
Adding to 1346161331 its reverse (1331616431), we get a palindrome (2677777762).
The spelling of 1346161331 in words is "one billion, three hundred forty-six million, one hundred sixty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •