Base | Representation |
---|---|
bin | 10001110001001010100… |
… | …101101101100101110001 |
3 | 11022201200010112001110101 |
4 | 101301022211231211301 |
5 | 130001123130041423 |
6 | 2332532501232401 |
7 | 154134031464436 |
oct | 21611245554561 |
9 | 4281603461411 |
10 | 1221022112113 |
11 | 430918172071 |
12 | 178785a02701 |
13 | 8b1ac9723bb |
14 | 43152475b8d |
15 | 21b655547ad |
hex | 11c4a96d971 |
1221022112113 has 8 divisors (see below), whose sum is σ = 1232441431496. Its totient is φ = 1209655296000.
The previous prime is 1221022112111. The next prime is 1221022112131. The reversal of 1221022112113 is 3112112201221.
It can be written as a sum of positive squares in 4 ways, for example, as 195485126769 + 1025536985344 = 442137^2 + 1012688^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1221022112113 - 21 = 1221022112111 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1221022112111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13079088 + ... + 13172113.
It is an arithmetic number, because the mean of its divisors is an integer number (154055178937).
Almost surely, 21221022112113 is an apocalyptic number.
It is an amenable number.
1221022112113 is a deficient number, since it is larger than the sum of its proper divisors (11419319383).
1221022112113 is a wasteful number, since it uses less digits than its factorization.
1221022112113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26251635.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 1221022112113 its reverse (3112112201221), we get a palindrome (4333134313334).
The spelling of 1221022112113 in words is "one trillion, two hundred twenty-one billion, twenty-two million, one hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •