Base | Representation |
---|---|
bin | 1100101111000001101000… |
… | …1001101110001101010111 |
3 | 1211120120200200202102100022 |
4 | 3023300122021232031113 |
5 | 3313402130212004033 |
6 | 45440240022535355 |
7 | 2643420260306234 |
oct | 313603211561527 |
9 | 54516620672308 |
10 | 14002032141143 |
11 | 4509257125382 |
12 | 16a183029755b |
13 | 7a7502c72a27 |
14 | 3659b82d278b |
15 | 19435950e098 |
hex | cbc1a26e357 |
14002032141143 has 8 divisors (see below), whose sum is σ = 14867680193568. Its totient is φ = 13141050655744.
The previous prime is 14002032141131. The next prime is 14002032141233. The reversal of 14002032141143 is 34114123020041.
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 14002032141143 - 216 = 14002032075607 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14002032141103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1166635571 + ... + 1166647572.
It is an arithmetic number, because the mean of its divisors is an integer number (1858460024196).
Almost surely, 214002032141143 is an apocalyptic number.
14002032141143 is a deficient number, since it is larger than the sum of its proper divisors (865648052425).
14002032141143 is a wasteful number, since it uses less digits than its factorization.
14002032141143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2333283513.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 14002032141143 its reverse (34114123020041), we get a palindrome (48116155161184).
The spelling of 14002032141143 in words is "fourteen trillion, two billion, thirty-two million, one hundred forty-one thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •