Base | Representation |
---|---|
bin | 10000010011001100011… |
… | …110110000100001100101 |
3 | 10222002020020100222021220 |
4 | 100103030132300201211 |
5 | 121323002230041401 |
6 | 2214324344130553 |
7 | 143632445600256 |
oct | 20231436604145 |
9 | 3862206328256 |
10 | 1120122112101 |
11 | 3a204a804703 |
12 | 161106766a59 |
13 | 8181c869295 |
14 | 3c2dda98b2d |
15 | 1e20c2dd336 |
hex | 104cc7b0865 |
1120122112101 has 8 divisors (see below), whose sum is σ = 1510277005440. Its totient is φ = 738357646752.
The previous prime is 1120122112097. The next prime is 1120122112103. The reversal of 1120122112101 is 1012112210211.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1120122112101 - 22 = 1120122112097 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1120122112103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2097606685 + ... + 2097607218.
It is an arithmetic number, because the mean of its divisors is an integer number (188784625680).
Almost surely, 21120122112101 is an apocalyptic number.
It is an amenable number.
1120122112101 is a deficient number, since it is larger than the sum of its proper divisors (390154893339).
1120122112101 is an equidigital number, since it uses as much as digits as its factorization.
1120122112101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4195213995.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 1120122112101 its reverse (1012112210211), we get a palindrome (2132234322312).
The spelling of 1120122112101 in words is "one trillion, one hundred twenty billion, one hundred twenty-two million, one hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •