Base | Representation |
---|---|
bin | 11101011011010100101… |
… | …00100110110000101101 |
3 | 10120122211101002210100200 |
4 | 32231222110212300231 |
5 | 113031213340213401 |
6 | 2052254325344113 |
7 | 133023012361200 |
oct | 16555224466055 |
9 | 3518741083320 |
10 | 1011101101101 |
11 | 35a895237513 |
12 | 143b5b868039 |
13 | 74467130c10 |
14 | 36d1a913937 |
15 | 1b47b126686 |
hex | eb6a526c2d |
1011101101101 has 72 divisors (see below), whose sum is σ = 1830289799520. Its totient is φ = 533130341184.
The previous prime is 1011101101057. The next prime is 1011101101117. The reversal of 1011101101101 is 1011011011101.
It is not a de Polignac number, because 1011101101101 - 210 = 1011101100077 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011101101201) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 16130046 + ... + 16192608.
It is an arithmetic number, because the mean of its divisors is an integer number (25420691660).
Almost surely, 21011101101101 is an apocalyptic number.
It is an amenable number.
1011101101101 is a deficient number, since it is larger than the sum of its proper divisors (819188698419).
1011101101101 is a wasteful number, since it uses less digits than its factorization.
1011101101101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65415 (or 65405 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 1011101101101 its reverse (1011011011101), we get a palindrome (2022112112202).
It can be divided in two parts, 1011101 and 101101, that multiplied together give a palindrome (102223322201).
The spelling of 1011101101101 in words is "one trillion, eleven billion, one hundred one million, one hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •