Base | Representation |
---|---|
bin | 11101011011010100110… |
… | …00110101100000110101 |
3 | 10120122211110012010121202 |
4 | 32231222120311200311 |
5 | 113031214131210401 |
6 | 2052254405222245 |
7 | 133023024660344 |
oct | 16555230654065 |
9 | 3518743163552 |
10 | 1011102210101 |
11 | 35a895924745 |
12 | 143b60101985 |
13 | 7446742b929 |
14 | 36d1ab21b5b |
15 | 1b47b29506b |
hex | eb6a635835 |
1011102210101 has 8 divisors (see below), whose sum is σ = 1011860875200. Its totient is φ = 1010343676320.
The previous prime is 1011102210059. The next prime is 1011102210113. The reversal of 1011102210101 is 1010122011101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1011102210101 is a prime.
It is a super-3 number, since 3×10111022101013 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011102210161) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19707440 + ... + 19758678.
It is an arithmetic number, because the mean of its divisors is an integer number (126482609400).
Almost surely, 21011102210101 is an apocalyptic number.
It is an amenable number.
1011102210101 is a deficient number, since it is larger than the sum of its proper divisors (758665099).
1011102210101 is a wasteful number, since it uses less digits than its factorization.
1011102210101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65659.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1011102210101 its reverse (1010122011101), we get a palindrome (2021224221202).
The spelling of 1011102210101 in words is "one trillion, eleven billion, one hundred two million, two hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •