Base | Representation |
---|---|
bin | 10011001000000110101… |
… | …001001010000110010111 |
3 | 11122122121210202111202012 |
4 | 103020012221022012113 |
5 | 133013313042221033 |
6 | 2443451445334435 |
7 | 163650230642351 |
oct | 23100651120627 |
9 | 4578553674665 |
10 | 1314371445143 |
11 | 467470462689 |
12 | 19289840741b |
13 | 96c3865a633 |
14 | 4788a1120d1 |
15 | 242ca97b248 |
hex | 13206a4a197 |
1314371445143 has 4 divisors (see below), whose sum is σ = 1314423415728. Its totient is φ = 1314319474560.
The previous prime is 1314371445109. The next prime is 1314371445157. The reversal of 1314371445143 is 3415441734131.
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 1314371445143 - 210 = 1314371444119 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1314371445143.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1314371445743) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25947338 + ... + 25997943.
It is an arithmetic number, because the mean of its divisors is an integer number (328605853932).
Almost surely, 21314371445143 is an apocalyptic number.
1314371445143 is a deficient number, since it is larger than the sum of its proper divisors (51970585).
1314371445143 is an equidigital number, since it uses as much as digits as its factorization.
1314371445143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51970584.
The product of its digits is 241920, while the sum is 41.
The spelling of 1314371445143 in words is "one trillion, three hundred fourteen billion, three hundred seventy-one million, four hundred forty-five thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •