Base | Representation |
---|---|
bin | 10001110100001001011… |
… | …000010010111011110001 |
3 | 11100000221012122012120210 |
4 | 101310021120102323301 |
5 | 130024202044341223 |
6 | 2334222244254333 |
7 | 154306250113404 |
oct | 21641130227361 |
9 | 4300835565523 |
10 | 1224223043313 |
11 | 43220aaa1056 |
12 | 1793199a13a9 |
13 | 8b59cb78a2a |
14 | 43377623d3b |
15 | 21ca1588893 |
hex | 11d09612ef1 |
1224223043313 has 8 divisors (see below), whose sum is σ = 1659963448800. Its totient is φ = 802315666688.
The previous prime is 1224223043299. The next prime is 1224223043317. The reversal of 1224223043313 is 3133403224221.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1224223043313 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1224223043317) 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 7 ways as a sum of consecutive naturals, for example, 3458257008 + ... + 3458257361.
It is an arithmetic number, because the mean of its divisors is an integer number (207495431100).
Almost surely, 21224223043313 is an apocalyptic number.
It is an amenable number.
1224223043313 is a deficient number, since it is larger than the sum of its proper divisors (435740405487).
1224223043313 is an equidigital number, since it uses as much as digits as its factorization.
1224223043313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6916514431.
The product of its (nonzero) digits is 20736, while the sum is 30.
Adding to 1224223043313 its reverse (3133403224221), we get a palindrome (4357626267534).
The spelling of 1224223043313 in words is "one trillion, two hundred twenty-four billion, two hundred twenty-three million, forty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •