Base | Representation |
---|---|
bin | 10011010011010000001… |
… | …101010010000110111101 |
3 | 11200210112010111001220122 |
4 | 103103100031102012331 |
5 | 133212322311221031 |
6 | 2453151423024325 |
7 | 164553006036215 |
oct | 23232015220675 |
9 | 4623463431818 |
10 | 1326343070141 |
11 | 4715540a3741 |
12 | 19507973b0a5 |
13 | 980c59689cb |
14 | 482a4065245 |
15 | 2477b99447b |
hex | 134d03521bd |
1326343070141 has 2 divisors, whose sum is σ = 1326343070142. Its totient is φ = 1326343070140.
The previous prime is 1326343070131. The next prime is 1326343070189. The reversal of 1326343070141 is 1410703436231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 781040575225 + 545302494916 = 883765^2 + 738446^2 .
It is a cyclic number.
It is not a de Polignac number, because 1326343070141 - 26 = 1326343070077 is a prime.
It is a super-3 number, since 3×13263430701413 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1326343070131) 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 as a sum of consecutive naturals, namely, 663171535070 + 663171535071.
It is an arithmetic number, because the mean of its divisors is an integer number (663171535071).
Almost surely, 21326343070141 is an apocalyptic number.
It is an amenable number.
1326343070141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1326343070141 is an equidigital number, since it uses as much as digits as its factorization.
1326343070141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36288, while the sum is 35.
The spelling of 1326343070141 in words is "one trillion, three hundred twenty-six billion, three hundred forty-three million, seventy thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •