Base | Representation |
---|---|
bin | 1101000010111100110101… |
… | …0110011001011110011111 |
3 | 1212210022020210021021110021 |
4 | 3100233031112121132133 |
5 | 3340004202244032033 |
6 | 50301411013453011 |
7 | 3010226066520565 |
oct | 320571526313637 |
9 | 55708223237407 |
10 | 14344341002143 |
11 | 46304455a30a9 |
12 | 1738042941167 |
13 | 8008862ac319 |
14 | 3783ac4d9a35 |
15 | 19d1e1226b2d |
hex | d0bcd59979f |
14344341002143 has 8 divisors (see below), whose sum is σ = 14379470493696. Its totient is φ = 14309228887200.
The previous prime is 14344341002129. The next prime is 14344341002153. The reversal of 14344341002143 is 34120014344341.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 14344341002143 - 237 = 14206902048671 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14344341002099 and 14344341002108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14344341002153) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2690368 + ... + 5993893.
It is an arithmetic number, because the mean of its divisors is an integer number (1797433811712).
Almost surely, 214344341002143 is an apocalyptic number.
14344341002143 is a deficient number, since it is larger than the sum of its proper divisors (35129491553).
14344341002143 is an equidigital number, since it uses as much as digits as its factorization.
14344341002143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8688305.
The product of its (nonzero) digits is 55296, while the sum is 34.
Adding to 14344341002143 its reverse (34120014344341), we get a palindrome (48464355346484).
The spelling of 14344341002143 in words is "fourteen trillion, three hundred forty-four billion, three hundred forty-one million, two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •