Base | Representation |
---|---|
bin | 1100111011010100110100… |
… | …0101011001001110000001 |
3 | 1212022210010002211222210202 |
4 | 3032311031011121032001 |
5 | 3330332410022321423 |
6 | 50121303540334545 |
7 | 2664610546653452 |
oct | 316651505311601 |
9 | 55283102758722 |
10 | 14213340042113 |
11 | 458a930a04983 |
12 | 17167829a4455 |
13 | 7c1409c22664 |
14 | 371d02113129 |
15 | 199ac5592728 |
hex | ced4d159381 |
14213340042113 has 2 divisors, whose sum is σ = 14213340042114. Its totient is φ = 14213340042112.
The previous prime is 14213340042103. The next prime is 14213340042137. The reversal of 14213340042113 is 31124004331241.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8665652287504 + 5547687754609 = 2943748^2 + 2355353^2 .
It is a cyclic number.
It is not a de Polignac number, because 14213340042113 - 220 = 14213338993537 is a prime.
It is a super-2 number, since 2×142133400421132 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (14213340042103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7106670021056 + 7106670021057.
It is an arithmetic number, because the mean of its divisors is an integer number (7106670021057).
Almost surely, 214213340042113 is an apocalyptic number.
It is an amenable number.
14213340042113 is a deficient number, since it is larger than the sum of its proper divisors (1).
14213340042113 is an equidigital number, since it uses as much as digits as its factorization.
14213340042113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 14213340042113 its reverse (31124004331241), we get a palindrome (45337344373354).
The spelling of 14213340042113 in words is "fourteen trillion, two hundred thirteen billion, three hundred forty million, forty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •