Base | Representation |
---|---|
bin | 11010111010111101… |
… | …01010011101100001 |
3 | 1101022021021201012112 |
4 | 31131132222131201 |
5 | 214100011034332 |
6 | 10350102405105 |
7 | 1021110232121 |
oct | 153536523541 |
9 | 41267251175 |
10 | 14453221217 |
11 | 6147515026 |
12 | 2974430795 |
13 | 1494495b06 |
14 | 9b1772c81 |
15 | 598d0adb2 |
hex | 35d7aa761 |
14453221217 has 2 divisors, whose sum is σ = 14453221218. Its totient is φ = 14453221216.
The previous prime is 14453221213. The next prime is 14453221219. The reversal of 14453221217 is 71212235441.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7628974336 + 6824246881 = 87344^2 + 82609^2 .
It is an emirp because it is prime and its reverse (71212235441) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14453221217 - 22 = 14453221213 is a prime.
It is a super-2 number, since 2×144532212172 (a number of 21 digits) contains 22 as substring.
Together with 14453221219, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (14453221213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7226610608 + 7226610609.
It is an arithmetic number, because the mean of its divisors is an integer number (7226610609).
Almost surely, 214453221217 is an apocalyptic number.
It is an amenable number.
14453221217 is a deficient number, since it is larger than the sum of its proper divisors (1).
14453221217 is an equidigital number, since it uses as much as digits as its factorization.
14453221217 is an evil number, because the sum of its binary digits is even.
The product of its digits is 13440, while the sum is 32.
Adding to 14453221217 its reverse (71212235441), we get a palindrome (85665456658).
The spelling of 14453221217 in words is "fourteen billion, four hundred fifty-three million, two hundred twenty-one thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •