Base | Representation |
---|---|
bin | 11010011111101010… |
… | …01100010111000101 |
3 | 1100201022102120112211 |
4 | 31033311030113011 |
5 | 213112401334323 |
6 | 10311242543421 |
7 | 1012330045402 |
oct | 151765142705 |
9 | 40638376484 |
10 | 14224246213 |
11 | 603a241791 |
12 | 290b807b71 |
13 | 1458c05248 |
14 | 98d1ab2a9 |
15 | 583b7b70d |
hex | 34fd4c5c5 |
14224246213 has 4 divisors (see below), whose sum is σ = 14224931308. Its totient is φ = 14223561120.
The previous prime is 14224246207. The next prime is 14224246229. The reversal of 14224246213 is 31264242241.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3770819649 + 10453426564 = 61407^2 + 102242^2 .
It is a cyclic number.
It is not a de Polignac number, because 14224246213 - 233 = 5634311621 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14224246313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 310398 + ... + 353263.
It is an arithmetic number, because the mean of its divisors is an integer number (3556232827).
Almost surely, 214224246213 is an apocalyptic number.
It is an amenable number.
14224246213 is a deficient number, since it is larger than the sum of its proper divisors (685095).
14224246213 is an equidigital number, since it uses as much as digits as its factorization.
14224246213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 685094.
The product of its digits is 18432, while the sum is 31.
Adding to 14224246213 its reverse (31264242241), we get a palindrome (45488488454).
The spelling of 14224246213 in words is "fourteen billion, two hundred twenty-four million, two hundred forty-six thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •