Base | Representation |
---|---|
bin | 10000000001011001010… |
… | …011111000001111101000 |
3 | 10220020220021120122111201 |
4 | 100001121103320033220 |
5 | 121014332030323422 |
6 | 2201444053333544 |
7 | 142355024452234 |
oct | 20013123701750 |
9 | 3806807518451 |
10 | 1101010011112 |
11 | 394a324a2320 |
12 | 1594720372b4 |
13 | 7ca9510c09b |
14 | 3b40969d5c4 |
15 | 1d98e4ad727 |
hex | 100594f83e8 |
1101010011112 has 64 divisors (see below), whose sum is σ = 2257577280000. Its totient is φ = 499235279040.
The previous prime is 1101010011103. The next prime is 1101010011113. The reversal of 1101010011112 is 2111100101011.
It is not an unprimeable number, because it can be changed into a prime (1101010011113) 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 15 ways as a sum of consecutive naturals, for example, 138889693 + ... + 138897619.
It is an arithmetic number, because the mean of its divisors is an integer number (35274645000).
Almost surely, 21101010011112 is an apocalyptic number.
It is an amenable number.
1101010011112 is an abundant number, since it is smaller than the sum of its proper divisors (1156567268888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101010011112 is a wasteful number, since it uses less digits than its factorization.
1101010011112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11606 (or 11602 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 1101010011112 its reverse (2111100101011), we get a palindrome (3212110112123).
The spelling of 1101010011112 in words is "one trillion, one hundred one billion, ten million, eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •