Base | Representation |
---|---|
bin | 1101000001101010011101… |
… | …1100001001110011001111 |
3 | 1212201012011211210002212021 |
4 | 3100122213130021303033 |
5 | 3334123411403440421 |
6 | 50243313001151011 |
7 | 3005514133350145 |
oct | 320324734116317 |
9 | 55635154702767 |
10 | 14322230140111 |
11 | 4622029597203 |
12 | 17338b1a8b467 |
13 | 7cb7714b27ca |
14 | 3772b1b3b595 |
15 | 19c849eea341 |
hex | d06a7709ccf |
14322230140111 has 4 divisors (see below), whose sum is σ = 14323939857232. Its totient is φ = 14320520422992.
The previous prime is 14322230140109. The next prime is 14322230140121. The reversal of 14322230140111 is 11104103222341.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 14322230140111 - 21 = 14322230140109 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 (14322230140121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 854845995 + ... + 854862748.
It is an arithmetic number, because the mean of its divisors is an integer number (3580984964308).
Almost surely, 214322230140111 is an apocalyptic number.
14322230140111 is a deficient number, since it is larger than the sum of its proper divisors (1709717121).
14322230140111 is an equidigital number, since it uses as much as digits as its factorization.
14322230140111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1709717120.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 14322230140111 its reverse (11104103222341), we get a palindrome (25426333362452).
The spelling of 14322230140111 in words is "fourteen trillion, three hundred twenty-two billion, two hundred thirty million, one hundred forty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •