Base | Representation |
---|---|
bin | 10011100010110111110… |
… | …010000100010010011101 |
3 | 11202101210212100110221102 |
4 | 103202313302010102131 |
5 | 134001143431323040 |
6 | 2505003452042445 |
7 | 166015411264136 |
oct | 23426762042235 |
9 | 4671725313842 |
10 | 1343113151645 |
11 | 47867a3a5131 |
12 | 198379a63425 |
13 | 9986912ac65 |
14 | 490153b4c8d |
15 | 24e0dda2515 |
hex | 138b7c8449d |
1343113151645 has 4 divisors (see below), whose sum is σ = 1611735781980. Its totient is φ = 1074490521312.
The previous prime is 1343113151599. The next prime is 1343113151647. The reversal of 1343113151645 is 5461513113431.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 683059272676 + 660053878969 = 826474^2 + 812437^2 .
It is a cyclic number.
It is not a de Polignac number, because 1343113151645 - 224 = 1343096374429 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1343113151599 and 1343113151608.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1343113151647) 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, 134311315160 + ... + 134311315169.
It is an arithmetic number, because the mean of its divisors is an integer number (402933945495).
Almost surely, 21343113151645 is an apocalyptic number.
It is an amenable number.
1343113151645 is a deficient number, since it is larger than the sum of its proper divisors (268622630335).
1343113151645 is an equidigital number, since it uses as much as digits as its factorization.
1343113151645 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 268622630334.
The product of its digits is 64800, while the sum is 38.
The spelling of 1343113151645 in words is "one trillion, three hundred forty-three billion, one hundred thirteen million, one hundred fifty-one thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •