Base | Representation |
---|---|
bin | 1100110000101111001010… |
… | …1100110010000000111001 |
3 | 1211200101120211110010112202 |
4 | 3030023302230302000321 |
5 | 3314342334330423301 |
6 | 45501541404315545 |
7 | 2645511016513223 |
oct | 314136254620071 |
9 | 54611524403482 |
10 | 14031435014201 |
11 | 451a7752a3070 |
12 | 16a7477242bb5 |
13 | 7aa20a706b77 |
14 | 3671a7301413 |
15 | 194eca9d666b |
hex | cc2f2b32039 |
14031435014201 has 8 divisors (see below), whose sum is σ = 15309311908800. Its totient is φ = 12753940101840.
The previous prime is 14031435014159. The next prime is 14031435014227. The reversal of 14031435014201 is 10241053413041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14031435014201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14031435044201) 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, 95418746 + ... + 95565683.
It is an arithmetic number, because the mean of its divisors is an integer number (1913663988600).
Almost surely, 214031435014201 is an apocalyptic number.
14031435014201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
14031435014201 is a deficient number, since it is larger than the sum of its proper divisors (1277876894599).
14031435014201 is a wasteful number, since it uses less digits than its factorization.
14031435014201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 190991119.
The product of its (nonzero) digits is 5760, while the sum is 29.
Adding to 14031435014201 its reverse (10241053413041), we get a palindrome (24272488427242).
The spelling of 14031435014201 in words is "fourteen trillion, thirty-one billion, four hundred thirty-five million, fourteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •