Base | Representation |
---|---|
bin | 1100111110101100001110… |
… | …0110111001010011010101 |
3 | 1212112022100220011012221101 |
4 | 3033223003212321103111 |
5 | 3332304320224014423 |
6 | 50204025401350101 |
7 | 3002025503641213 |
oct | 317530346712325 |
9 | 55468326135841 |
10 | 14271163110613 |
11 | 46024035890a2 |
12 | 1725a1b798331 |
13 | 7c69c36671a6 |
14 | 374a29811cb3 |
15 | 19b35bb337ad |
hex | cfac39b94d5 |
14271163110613 has 4 divisors (see below), whose sum is σ = 15022276958560. Its totient is φ = 13520049262668.
The previous prime is 14271163110593. The next prime is 14271163110619. The reversal of 14271163110613 is 31601136117241.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14271163110613 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 (14271163110619) 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, 375556923945 + ... + 375556923982.
It is an arithmetic number, because the mean of its divisors is an integer number (3755569239640).
Almost surely, 214271163110613 is an apocalyptic number.
It is an amenable number.
14271163110613 is a deficient number, since it is larger than the sum of its proper divisors (751113847947).
14271163110613 is an equidigital number, since it uses as much as digits as its factorization.
14271163110613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 751113847946.
The product of its (nonzero) digits is 18144, while the sum is 37.
Adding to 14271163110613 its reverse (31601136117241), we get a palindrome (45872299227854).
The spelling of 14271163110613 in words is "fourteen trillion, two hundred seventy-one billion, one hundred sixty-three million, one hundred ten thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •