Base | Representation |
---|---|
bin | 10000000001011001010… |
… | …111101110100101010000 |
3 | 10220020220100110220121002 |
4 | 100001121113232211100 |
5 | 121014332310120422 |
6 | 2201444131121132 |
7 | 142355036154023 |
oct | 20013127564520 |
9 | 3806810426532 |
10 | 1101011020112 |
11 | 394a33021403 |
12 | 1594724431a8 |
13 | 7ca953a3423 |
14 | 3b4098831ba |
15 | 1d98e60c692 |
hex | 100595ee950 |
1101011020112 has 20 divisors (see below), whose sum is σ = 2133452834580. Its totient is φ = 550442546688.
The previous prime is 1101011020111. The next prime is 1101011020141. The reversal of 1101011020112 is 2110201101011.
It can be written as a sum of positive squares in 2 ways, for example, as 893508905536 + 207502114576 = 945256^2 + 455524^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1101011020093 and 1101011020102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101011020111) 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, 3790787 + ... + 4070882.
It is an arithmetic number, because the mean of its divisors is an integer number (106672641729).
Almost surely, 21101011020112 is an apocalyptic number.
It is an amenable number.
1101011020112 is a deficient number, since it is larger than the sum of its proper divisors (1032441814468).
1101011020112 is an equidigital number, since it uses as much as digits as its factorization.
1101011020112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7870430 (or 7870424 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1101011020112 its reverse (2110201101011), we get a palindrome (3211212121123).
The spelling of 1101011020112 in words is "one trillion, one hundred one billion, eleven million, twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •