Base | Representation |
---|---|
bin | 1100110000010011111011… |
… | …0101100010101000010111 |
3 | 1211122200201012120002110220 |
4 | 3030010332311202220113 |
5 | 3314232400321204221 |
6 | 45454332022445423 |
7 | 2645131553632410 |
oct | 314047665425027 |
9 | 54580635502426 |
10 | 14024122444311 |
11 | 451766256a081 |
12 | 16a5b76293873 |
13 | 7a9613721935 |
14 | 366ab205c807 |
15 | 194beda290c6 |
hex | cc13ed62a17 |
14024122444311 has 8 divisors (see below), whose sum is σ = 21370091343744. Its totient is φ = 8013784253880.
The previous prime is 14024122444303. The next prime is 14024122444349. The reversal of 14024122444311 is 11344422142041.
14024122444311 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 14024122444311 - 23 = 14024122444303 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14024122464311) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 333907677225 + ... + 333907677266.
It is an arithmetic number, because the mean of its divisors is an integer number (2671261417968).
Almost surely, 214024122444311 is an apocalyptic number.
14024122444311 is a deficient number, since it is larger than the sum of its proper divisors (7345968899433).
14024122444311 is an equidigital number, since it uses as much as digits as its factorization.
14024122444311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 667815354501.
The product of its (nonzero) digits is 24576, while the sum is 33.
Adding to 14024122444311 its reverse (11344422142041), we get a palindrome (25368544586352).
The spelling of 14024122444311 in words is "fourteen trillion, twenty-four billion, one hundred twenty-two million, four hundred forty-four thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •