Base | Representation |
---|---|
bin | 10001110011001000010… |
… | …011000001011111011001 |
3 | 11022221010010000212201022 |
4 | 101303020103001133121 |
5 | 130014433033021410 |
6 | 2333522041132225 |
7 | 154240221111065 |
oct | 21631023013731 |
9 | 4287103025638 |
10 | 1223131142105 |
11 | 4317aa708564 |
12 | 17907418a075 |
13 | 8b4578a2442 |
14 | 432b25d2aa5 |
15 | 21c3a7a2455 |
hex | 11cc84c17d9 |
1223131142105 has 4 divisors (see below), whose sum is σ = 1467757370532. Its totient is φ = 978504913680.
The previous prime is 1223131142063. The next prime is 1223131142119. The reversal of 1223131142105 is 5012411313221.
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 800531036176 + 422600105929 = 894724^2 + 650077^2 .
It is not a de Polignac number, because 1223131142105 - 228 = 1222862706649 is a prime.
It is a Duffinian number.
It is an unprimeable number.
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, 122313114206 + ... + 122313114215.
It is an arithmetic number, because the mean of its divisors is an integer number (366939342633).
Almost surely, 21223131142105 is an apocalyptic number.
It is an amenable number.
1223131142105 is a deficient number, since it is larger than the sum of its proper divisors (244626228427).
1223131142105 is an equidigital number, since it uses as much as digits as its factorization.
1223131142105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 244626228426.
The product of its (nonzero) digits is 1440, while the sum is 26.
Adding to 1223131142105 its reverse (5012411313221), we get a palindrome (6235542455326).
The spelling of 1223131142105 in words is "one trillion, two hundred twenty-three billion, one hundred thirty-one million, one hundred forty-two thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •