Base | Representation |
---|---|
bin | 10000010011010001110… |
… | …001110101111100011000 |
3 | 10222002110102122000002111 |
4 | 100103101301311330120 |
5 | 121323143004013422 |
6 | 2214341241242104 |
7 | 143634605255020 |
oct | 20232161657430 |
9 | 3862412560074 |
10 | 1120211001112 |
11 | 3a20959a72a5 |
12 | 161130493334 |
13 | 818350bc628 |
14 | 3c30b7d6a80 |
15 | 1e214eeaa77 |
hex | 104d1c75f18 |
1120211001112 has 64 divisors (see below), whose sum is σ = 2404519603200. Its totient is φ = 479277657600.
The previous prime is 1120211001101. The next prime is 1120211001113. The reversal of 1120211001112 is 2111001120211.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 1120211001092 and 1120211001101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1120211001113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 90326112 + ... + 90338512.
It is an arithmetic number, because the mean of its divisors is an integer number (37570618800).
Almost surely, 21120211001112 is an apocalyptic number.
It is an amenable number.
1120211001112 is an abundant number, since it is smaller than the sum of its proper divisors (1284308602088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1120211001112 is a wasteful number, since it uses less digits than its factorization.
1120211001112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15016 (or 15012 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1120211001112 its reverse (2111001120211), we get a palindrome (3231212121323).
The spelling of 1120211001112 in words is "one trillion, one hundred twenty billion, two hundred eleven million, one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •