Base | Representation |
---|---|
bin | 100000101001001001110… |
… | …011110000101011011101 |
3 | 21221110010020200122220001 |
4 | 200221021303300223131 |
5 | 243223044033442023 |
6 | 4434303401454301 |
7 | 321031602612121 |
oct | 40511163605335 |
9 | 7843106618801 |
10 | 2243211234013 |
11 | 795382296732 |
12 | 3028baaa1391 |
13 | 1336c3008a69 |
14 | 7a80180d581 |
15 | 3d53ed056ad |
hex | 20a49cf0add |
2243211234013 has 4 divisors (see below), whose sum is σ = 2303838564700. Its totient is φ = 2182583903328.
The previous prime is 2243211233999. The next prime is 2243211234071. The reversal of 2243211234013 is 3104321123422.
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 1568360484964 + 674850749049 = 1252342^2 + 821493^2 .
It is a de Polignac number, because none of the positive numbers 2k-2243211234013 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 (2243211231013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 30313665288 + ... + 30313665361.
It is an arithmetic number, because the mean of its divisors is an integer number (575959641175).
Almost surely, 22243211234013 is an apocalyptic number.
It is an amenable number.
2243211234013 is a deficient number, since it is larger than the sum of its proper divisors (60627330687).
2243211234013 is an equidigital number, since it uses as much as digits as its factorization.
2243211234013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 60627330686.
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 2243211234013 its reverse (3104321123422), we get a palindrome (5347532357435).
The spelling of 2243211234013 in words is "two trillion, two hundred forty-three billion, two hundred eleven million, two hundred thirty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.137 sec. • engine limits •