Base | Representation |
---|---|
bin | 1101000001101110111110… |
… | …0111111111011100111001 |
3 | 1212201022022020121110211101 |
4 | 3100123233213333130321 |
5 | 3334133401421444001 |
6 | 50244033102331401 |
7 | 3005556140252560 |
oct | 320335747773471 |
9 | 55638266543741 |
10 | 14323441203001 |
11 | 46225a0169727 |
12 | 1733b8b589b61 |
13 | 7cb90537b578 |
14 | 37738890abd7 |
15 | 19c8bb4bda01 |
hex | d06ef9ff739 |
14323441203001 has 8 divisors (see below), whose sum is σ = 16371601274240. Its totient is φ = 12275769678048.
The previous prime is 14323441202957. The next prime is 14323441203121. The reversal of 14323441203001 is 10030214432341.
It is a happy number.
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 14323441203001 - 211 = 14323441200953 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14323441200001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 122073741 + ... + 122191018.
It is an arithmetic number, because the mean of its divisors is an integer number (2046450159280).
Almost surely, 214323441203001 is an apocalyptic number.
It is an amenable number.
14323441203001 is a deficient number, since it is larger than the sum of its proper divisors (2048160071239).
14323441203001 is an equidigital number, since it uses as much as digits as its factorization.
14323441203001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 244273143.
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 14323441203001 its reverse (10030214432341), we get a palindrome (24353655635342).
The spelling of 14323441203001 in words is "fourteen trillion, three hundred twenty-three billion, four hundred forty-one million, two hundred three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •