Base | Representation |
---|---|
bin | 1101000010001100110001… |
… | …1010010010000011011011 |
3 | 1212202001221201101210120112 |
4 | 3100203030122102003123 |
5 | 3334301242211404321 |
6 | 50251434531514535 |
7 | 3006261310643330 |
oct | 320431432220333 |
9 | 55661851353515 |
10 | 14331440341211 |
11 | 4625a254a8654 |
12 | 1735642458a4b |
13 | 7cc5ab67c346 |
14 | 37790702c987 |
15 | 19cbd8898a5b |
hex | d08cc6920db |
14331440341211 has 4 divisors (see below), whose sum is σ = 16378788961392. Its totient is φ = 12284091721032.
The previous prime is 14331440341189. The next prime is 14331440341219. The reversal of 14331440341211 is 11214304413341.
It is a happy number.
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 14331440341211 - 234 = 14314260472027 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14331440341219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1023674310080 + ... + 1023674310093.
It is an arithmetic number, because the mean of its divisors is an integer number (4094697240348).
Almost surely, 214331440341211 is an apocalyptic number.
14331440341211 is a deficient number, since it is larger than the sum of its proper divisors (2047348620181).
14331440341211 is an equidigital number, since it uses as much as digits as its factorization.
14331440341211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2047348620180.
The product of its (nonzero) digits is 13824, while the sum is 32.
Adding to 14331440341211 its reverse (11214304413341), we get a palindrome (25545744754552).
The spelling of 14331440341211 in words is "fourteen trillion, three hundred thirty-one billion, four hundred forty million, three hundred forty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •