Base | Representation |
---|---|
bin | 11101011011010100101… |
… | …00100110100010110100 |
3 | 10120122211101002202010202 |
4 | 32231222110212202310 |
5 | 113031213340201322 |
6 | 2052254325340032 |
7 | 133023012355460 |
oct | 16555224464264 |
9 | 3518741082122 |
10 | 1011101100212 |
11 | 35a895236885 |
12 | 143b5b867618 |
13 | 744671306a8 |
14 | 36d1a9134a0 |
15 | 1b47b126292 |
hex | eb6a5268b4 |
1011101100212 has 12 divisors (see below), whose sum is σ = 2022202200480. Its totient is φ = 433329042936.
The previous prime is 1011101100193. The next prime is 1011101100301. The reversal of 1011101100212 is 2120011011101.
1011101100212 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
1011101100212 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 1011101100193 and 1011101100202.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18055376762 + ... + 18055376817.
It is an arithmetic number, because the mean of its divisors is an integer number (168516850040).
Almost surely, 21011101100212 is an apocalyptic number.
It is an amenable number.
1011101100212 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1011101100212 is a wasteful number, since it uses less digits than its factorization.
1011101100212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36110753590 (or 36110753588 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1011101100212 its reverse (2120011011101), we get a palindrome (3131112111313).
The spelling of 1011101100212 in words is "one trillion, eleven billion, one hundred one million, one hundred thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •