Base | Representation |
---|---|
bin | 1100111011110001110110… |
… | …1001011111111011011111 |
3 | 1212100112020021210221020221 |
4 | 3032330131221133323133 |
5 | 3330444340314310012 |
6 | 50125033203022211 |
7 | 2665304650444402 |
oct | 316743551377337 |
9 | 55315207727227 |
10 | 14221134135007 |
11 | 4593170525268 |
12 | 171819906a967 |
13 | 7c207c8c0847 |
14 | 3724412dbd39 |
15 | 199dce968507 |
hex | cef1da5fedf |
14221134135007 has 2 divisors, whose sum is σ = 14221134135008. Its totient is φ = 14221134135006.
The previous prime is 14221134134953. The next prime is 14221134135029. The reversal of 14221134135007 is 70053143112241.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 14221134135007 - 239 = 13671378321119 is a prime.
It is a super-3 number, since 3×142211341350073 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14221134135067) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7110567067503 + 7110567067504.
It is an arithmetic number, because the mean of its divisors is an integer number (7110567067504).
Almost surely, 214221134135007 is an apocalyptic number.
14221134135007 is a deficient number, since it is larger than the sum of its proper divisors (1).
14221134135007 is an equidigital number, since it uses as much as digits as its factorization.
14221134135007 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20160, while the sum is 34.
Adding to 14221134135007 its reverse (70053143112241), we get a palindrome (84274277247248).
The spelling of 14221134135007 in words is "fourteen trillion, two hundred twenty-one billion, one hundred thirty-four million, one hundred thirty-five thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •