Base | Representation |
---|---|
bin | 1101000001100110101101… |
… | …0111100110100110100011 |
3 | 1212201002120121101020220012 |
4 | 3100121223113212212203 |
5 | 3334114330403030103 |
6 | 50243025000035135 |
7 | 3005450145103604 |
oct | 320315327464643 |
9 | 55632517336805 |
10 | 14321222314403 |
11 | 46216617088a4 |
12 | 1733670462aab |
13 | 7cb640765634 |
14 | 377217d53dab |
15 | 19c7db7c02d8 |
hex | d066b5e69a3 |
14321222314403 has 2 divisors, whose sum is σ = 14321222314404. Its totient is φ = 14321222314402.
The previous prime is 14321222314367. The next prime is 14321222314523. The reversal of 14321222314403 is 30441322212341.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 14321222314403 - 228 = 14320953878947 is a prime.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 14321222314403.
It is not a weakly prime, because it can be changed into another prime (14321222314103) 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 as a sum of consecutive naturals, namely, 7160611157201 + 7160611157202.
It is an arithmetic number, because the mean of its divisors is an integer number (7160611157202).
Almost surely, 214321222314403 is an apocalyptic number.
14321222314403 is a deficient number, since it is larger than the sum of its proper divisors (1).
14321222314403 is an equidigital number, since it uses as much as digits as its factorization.
14321222314403 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27648, while the sum is 32.
Adding to 14321222314403 its reverse (30441322212341), we get a palindrome (44762544526744).
The spelling of 14321222314403 in words is "fourteen trillion, three hundred twenty-one billion, two hundred twenty-two million, three hundred fourteen thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •