Base | Representation |
---|---|
bin | 1100111101000100011011… |
… | …1010100110101001110011 |
3 | 1212102122110011021200020211 |
4 | 3033101012322212221303 |
5 | 3331330240114240311 |
6 | 50143140550444551 |
7 | 3000021166432645 |
oct | 317210672465163 |
9 | 55378404250224 |
10 | 14243301321331 |
11 | 45a1606301465 |
12 | 1720544963757 |
13 | 7c41a327b244 |
14 | 37354535c895 |
15 | 19a77aabd821 |
hex | cf446ea6a73 |
14243301321331 has 2 divisors, whose sum is σ = 14243301321332. Its totient is φ = 14243301321330.
The previous prime is 14243301321329. The next prime is 14243301321343. The reversal of 14243301321331 is 13312310334241.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 14243301321331 - 21 = 14243301321329 is a prime.
It is a super-2 number, since 2×142433013213312 (a number of 27 digits) contains 22 as substring.
Together with 14243301321329, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 14243301321293 and 14243301321302.
It is not a weakly prime, because it can be changed into another prime (14243301321311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7121650660665 + 7121650660666.
It is an arithmetic number, because the mean of its divisors is an integer number (7121650660666).
Almost surely, 214243301321331 is an apocalyptic number.
14243301321331 is a deficient number, since it is larger than the sum of its proper divisors (1).
14243301321331 is an equidigital number, since it uses as much as digits as its factorization.
14243301321331 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 15552, while the sum is 31.
Adding to 14243301321331 its reverse (13312310334241), we get a palindrome (27555611655572).
The spelling of 14243301321331 in words is "fourteen trillion, two hundred forty-three billion, three hundred one million, three hundred twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •