Base | Representation |
---|---|
bin | 10000010011000101111… |
… | …010110000011000001110 |
3 | 10222001221120012021000011 |
4 | 100103011322300120032 |
5 | 121322241033323042 |
6 | 2214305412223434 |
7 | 143626641005002 |
oct | 20230572603016 |
9 | 3861846167004 |
10 | 1120012011022 |
11 | 3a1aa3644083 |
12 | 16109590ab7a |
13 | 81802ac9c08 |
14 | 3c2cd1d8702 |
15 | 1e2027e0a17 |
hex | 104c5eb060e |
1120012011022 has 8 divisors (see below), whose sum is σ = 1719088203096. Its totient is φ = 546982609992.
The previous prime is 1120012010981. The next prime is 1120012011023. The reversal of 1120012011022 is 2201102100211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 1120012010993 and 1120012011011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1120012011023) 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 3 ways as a sum of consecutive naturals, for example, 6511697653 + ... + 6511697824.
It is an arithmetic number, because the mean of its divisors is an integer number (214886025387).
Almost surely, 21120012011022 is an apocalyptic number.
1120012011022 is a deficient number, since it is larger than the sum of its proper divisors (599076192074).
1120012011022 is a wasteful number, since it uses less digits than its factorization.
1120012011022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13023395522.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1120012011022 its reverse (2201102100211), we get a palindrome (3321114111233).
The spelling of 1120012011022 in words is "one trillion, one hundred twenty billion, twelve million, eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •