Base | Representation |
---|---|
bin | 10001101001111111101… |
… | …000100111001011000001 |
3 | 11021222210111122102212212 |
4 | 101221333220213023001 |
5 | 124334340431130423 |
6 | 2325220440031505 |
7 | 153442152640352 |
oct | 21517750471301 |
9 | 4258714572785 |
10 | 1213322130113 |
11 | 428626790685 |
12 | 177197162595 |
13 | 8a553635332 |
14 | 42a21987d29 |
15 | 2186456d578 |
hex | 11a7fa272c1 |
1213322130113 has 4 divisors (see below), whose sum is σ = 1213824127620. Its totient is φ = 1212820132608.
The previous prime is 1213322130067. The next prime is 1213322130121. The reversal of 1213322130113 is 3110312233121.
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 911016798784 + 302305331329 = 954472^2 + 549823^2 .
It is a cyclic number.
It is not a de Polignac number, because 1213322130113 - 26 = 1213322130049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1213322130133) 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, 250995128 + ... + 250999961.
It is an arithmetic number, because the mean of its divisors is an integer number (303456031905).
Almost surely, 21213322130113 is an apocalyptic number.
It is an amenable number.
1213322130113 is a deficient number, since it is larger than the sum of its proper divisors (501997507).
1213322130113 is an equidigital number, since it uses as much as digits as its factorization.
1213322130113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 501997506.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 1213322130113 its reverse (3110312233121), we get a palindrome (4323634363234).
The spelling of 1213322130113 in words is "one trillion, two hundred thirteen billion, three hundred twenty-two million, one hundred thirty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •