Base | Representation |
---|---|
bin | 11101011011010100100… |
… | …00110111010000100101 |
3 | 10120122211022020221200100 |
4 | 32231222100313100211 |
5 | 113031213112320401 |
6 | 2052254252334313 |
7 | 133023001134141 |
oct | 16555220672045 |
9 | 3518738227610 |
10 | 1011100120101 |
11 | 35a894727475 |
12 | 143b5b474399 |
13 | 74466b79546 |
14 | 36d1a73a221 |
15 | 1b47aed0b86 |
hex | eb6a437425 |
1011100120101 has 48 divisors (see below), whose sum is σ = 1657234335744. Its totient is φ = 590431514112.
The previous prime is 1011100120091. The next prime is 1011100120127. The reversal of 1011100120101 is 1010210011101.
1011100120101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1011100120101 - 225 = 1011066565669 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011100120141) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3752581 + ... + 4012986.
It is an arithmetic number, because the mean of its divisors is an integer number (34525715328).
Almost surely, 21011100120101 is an apocalyptic number.
It is an amenable number.
1011100120101 is a deficient number, since it is larger than the sum of its proper divisors (646134215643).
1011100120101 is a wasteful number, since it uses less digits than its factorization.
1011100120101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7765650 (or 7765647 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1011100120101 its reverse (1010210011101), we get a palindrome (2021310131202).
The spelling of 1011100120101 in words is "one trillion, eleven billion, one hundred million, one hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •