Base | Representation |
---|---|
bin | 10000010011000101111… |
… | …111011010001111111101 |
3 | 10222001221122111020122021 |
4 | 100103011333122033331 |
5 | 121322241341343401 |
6 | 2214305454320141 |
7 | 143626654246042 |
oct | 20230577321775 |
9 | 3861848436567 |
10 | 1120013231101 |
11 | 3a1aa42a7806 |
12 | 1610961b9051 |
13 | 8180313635b |
14 | 3c2cd4351c9 |
15 | 1e2029822a1 |
hex | 104c5fda3fd |
1120013231101 has 8 divisors (see below), whose sum is σ = 1140021576608. Its totient is φ = 1100058030000.
The previous prime is 1120013231089. The next prime is 1120013231107. The reversal of 1120013231101 is 1011323100211.
It is a happy number.
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 1120013231101 - 215 = 1120013198333 is a prime.
It is a super-3 number, since 3×11200132311013 (a number of 37 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1120013231107) 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, 13243575 + ... + 13327876.
It is an arithmetic number, because the mean of its divisors is an integer number (142502697076).
Almost surely, 21120013231101 is an apocalyptic number.
It is an amenable number.
1120013231101 is a deficient number, since it is larger than the sum of its proper divisors (20008345507).
1120013231101 is an equidigital number, since it uses as much as digits as its factorization.
1120013231101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26572203.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 1120013231101 its reverse (1011323100211), we get a palindrome (2131336331312).
The spelling of 1120013231101 in words is "one trillion, one hundred twenty billion, thirteen million, two hundred thirty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •