Base | Representation |
---|---|
bin | 10000010100000001100… |
… | …101101001100011100101 |
3 | 10222011112022221102000121 |
4 | 100110001211221203211 |
5 | 121331313324023023 |
6 | 2214553013241541 |
7 | 143663515136605 |
oct | 20240145514345 |
9 | 3864468842017 |
10 | 1121013111013 |
11 | 3a2467749344 |
12 | 1613150332b1 |
13 | 81932330983 |
14 | 3c386150c05 |
15 | 1e26063cd5d |
hex | 105019698e5 |
1121013111013 has 8 divisors (see below), whose sum is σ = 1162709883000. Its totient is φ = 1079916292800.
The previous prime is 1121013110983. The next prime is 1121013111059. The reversal of 1121013111013 is 3101113101211.
It can be written as a sum of positive squares in 4 ways, for example, as 826122841569 + 294890269444 = 908913^2 + 543038^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 1121013111013 - 225 = 1120979556581 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 (1121013111073) 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, 149984638 + ... + 149992111.
It is an arithmetic number, because the mean of its divisors is an integer number (145338735375).
Almost surely, 21121013111013 is an apocalyptic number.
It is an amenable number.
1121013111013 is a deficient number, since it is larger than the sum of its proper divisors (41696771987).
1121013111013 is a wasteful number, since it uses less digits than its factorization.
1121013111013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 299976887.
The product of its (nonzero) digits is 18, while the sum is 16.
Adding to 1121013111013 its reverse (3101113101211), we get a palindrome (4222126212224).
The spelling of 1121013111013 in words is "one trillion, one hundred twenty-one billion, thirteen million, one hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •