Base | Representation |
---|---|
bin | 1100001110010100110011… |
… | …1011011010110111011111 |
3 | 1202120212121122222002000201 |
4 | 3003211030323122313133 |
5 | 3230201104242023033 |
6 | 44330210150404331 |
7 | 2555011521131032 |
oct | 303451473326737 |
9 | 52525548862021 |
10 | 13440243314143 |
11 | 4311a7aa676a8 |
12 | 16109863606a7 |
13 | 7665428ba479 |
14 | 346722c11019 |
15 | 1849290ca47d |
hex | c394cedaddf |
13440243314143 has 4 divisors (see below), whose sum is σ = 13440264606288. Its totient is φ = 13440222022000.
The previous prime is 13440243314119. The next prime is 13440243314153. The reversal of 13440243314143 is 34141334204431.
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 13440243314143 - 25 = 13440243314111 is a prime.
It is a super-2 number, since 2×134402433141432 (a number of 27 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 (13440243314153) 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, 9669358 + ... + 10971643.
It is an arithmetic number, because the mean of its divisors is an integer number (3360066151572).
Almost surely, 213440243314143 is an apocalyptic number.
13440243314143 is a deficient number, since it is larger than the sum of its proper divisors (21292145).
13440243314143 is an equidigital number, since it uses as much as digits as its factorization.
13440243314143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21292144.
The product of its (nonzero) digits is 165888, while the sum is 37.
Adding to 13440243314143 its reverse (34141334204431), we get a palindrome (47581577518574).
The spelling of 13440243314143 in words is "thirteen trillion, four hundred forty billion, two hundred forty-three million, three hundred fourteen thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •