Base | Representation |
---|---|
bin | 1100111010101110101011… |
… | …1011110111011000100101 |
3 | 1212021210200200212211222121 |
4 | 3032223222323313120211 |
5 | 3330200423440124334 |
6 | 50112452102425541 |
7 | 2664066100210564 |
oct | 316535273673045 |
9 | 55253620784877 |
10 | 14203103442469 |
11 | 458655868a077 |
12 | 17147a67322b1 |
13 | 7c0468204cc6 |
14 | 3716107a1bdb |
15 | 1996c6a4adb4 |
hex | ceaeaef7625 |
14203103442469 has 2 divisors, whose sum is σ = 14203103442470. Its totient is φ = 14203103442468.
The previous prime is 14203103442397. The next prime is 14203103442481. The reversal of 14203103442469 is 96424430130241.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14198050080900 + 5053361569 = 3768030^2 + 71087^2 .
It is an emirp because it is prime and its reverse (96424430130241) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14203103442469 - 219 = 14203102918181 is a prime.
It is a super-2 number, since 2×142031034424692 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14203103442569) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7101551721234 + 7101551721235.
It is an arithmetic number, because the mean of its divisors is an integer number (7101551721235).
Almost surely, 214203103442469 is an apocalyptic number.
It is an amenable number.
14203103442469 is a deficient number, since it is larger than the sum of its proper divisors (1).
14203103442469 is an equidigital number, since it uses as much as digits as its factorization.
14203103442469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 497664, while the sum is 43.
The spelling of 14203103442469 in words is "fourteen trillion, two hundred three billion, one hundred three million, four hundred forty-two thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •