Base | Representation |
---|---|
bin | 10011001000010000000… |
… | …111010011000111011111 |
3 | 11122200000212202021100122 |
4 | 103020100013103013133 |
5 | 133014124231410333 |
6 | 2443515323145155 |
7 | 163654200353522 |
oct | 23102007230737 |
9 | 4580025667318 |
10 | 1314530341343 |
11 | 46754212075a |
12 | 1929216751bb |
13 | 96c6255285b |
14 | 478a3274bb9 |
15 | 242d98b6798 |
hex | 132101d31df |
1314530341343 has 16 divisors (see below), whose sum is σ = 1348256501760. Its totient is φ = 1281199622976.
The previous prime is 1314530341307. The next prime is 1314530341357. The reversal of 1314530341343 is 3431430354131.
It is a cyclic number.
It is not a de Polignac number, because 1314530341343 - 212 = 1314530337247 is a prime.
It is a super-2 number, since 2×13145303413432 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1314530341393) 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 15 ways as a sum of consecutive naturals, for example, 11052971 + ... + 11171267.
It is an arithmetic number, because the mean of its divisors is an integer number (84266031360).
Almost surely, 21314530341343 is an apocalyptic number.
1314530341343 is a deficient number, since it is larger than the sum of its proper divisors (33726160417).
1314530341343 is a wasteful number, since it uses less digits than its factorization.
1314530341343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119966.
The product of its (nonzero) digits is 77760, while the sum is 35.
Adding to 1314530341343 its reverse (3431430354131), we get a palindrome (4745960695474).
The spelling of 1314530341343 in words is "one trillion, three hundred fourteen billion, five hundred thirty million, three hundred forty-one thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •