Base | Representation |
---|---|
bin | 1100111011110110101110… |
… | …1110101111100000111011 |
3 | 1212100122121120210200212022 |
4 | 3032331223232233200323 |
5 | 3331010031144214121 |
6 | 50125411200505055 |
7 | 2665352265313664 |
oct | 316755356574073 |
9 | 55318546720768 |
10 | 14222444132411 |
11 | 4593782a30749 |
12 | 17184a391b18b |
13 | 7c222b119138 |
14 | 3725272a236b |
15 | 199e59980aab |
hex | cef6bbaf83b |
14222444132411 has 8 divisors (see below), whose sum is σ = 14423889620448. Its totient is φ = 14021030016000.
The previous prime is 14222444132371. The next prime is 14222444132417. The reversal of 14222444132411 is 11423144422241.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 14222444132411 - 218 = 14222443870267 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14222444132417) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6929030 + ... + 8743931.
It is an arithmetic number, because the mean of its divisors is an integer number (1802986202556).
Almost surely, 214222444132411 is an apocalyptic number.
14222444132411 is a deficient number, since it is larger than the sum of its proper divisors (201445488037).
14222444132411 is a wasteful number, since it uses less digits than its factorization.
14222444132411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15685813.
The product of its digits is 49152, while the sum is 35.
Adding to 14222444132411 its reverse (11423144422241), we get a palindrome (25645588554652).
The spelling of 14222444132411 in words is "fourteen trillion, two hundred twenty-two billion, four hundred forty-four million, one hundred thirty-two thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •