Base | Representation |
---|---|
bin | 10001110010010001011… |
… | …101011101001010011101 |
3 | 11022211201222212102101101 |
4 | 101302101131131022131 |
5 | 130011042022130023 |
6 | 2333250454113101 |
7 | 154205350123066 |
oct | 21622135351235 |
9 | 4284658772341 |
10 | 1222211130013 |
11 | 431378357895 |
12 | 178a5804b791 |
13 | 8b33c0bcca3 |
14 | 4322634756d |
15 | 21bd4b211ad |
hex | 11c9175d29d |
1222211130013 has 4 divisors (see below), whose sum is σ = 1242247378108. Its totient is φ = 1202174881920.
The previous prime is 1222211130011. The next prime is 1222211130043. The reversal of 1222211130013 is 3100311122221.
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 605965719844 + 616245410169 = 778438^2 + 785013^2 .
It is a cyclic number.
It is not a de Polignac number, because 1222211130013 - 21 = 1222211130011 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 (1222211130011) 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, 10018123956 + ... + 10018124077.
It is an arithmetic number, because the mean of its divisors is an integer number (310561844527).
Almost surely, 21222211130013 is an apocalyptic number.
It is an amenable number.
1222211130013 is a deficient number, since it is larger than the sum of its proper divisors (20036248095).
1222211130013 is an equidigital number, since it uses as much as digits as its factorization.
1222211130013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20036248094.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 1222211130013 its reverse (3100311122221), we get a palindrome (4322522252234).
The spelling of 1222211130013 in words is "one trillion, two hundred twenty-two billion, two hundred eleven million, one hundred thirty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.229 sec. • engine limits •