Base | Representation |
---|---|
bin | 11101011011010100101… |
… | …00101000111100000101 |
3 | 10120122211101010020121001 |
4 | 32231222110220330011 |
5 | 113031213341010041 |
6 | 2052254325453301 |
7 | 133023012426202 |
oct | 16555224507405 |
9 | 3518741106531 |
10 | 1011101110021 |
11 | 35a895243192 |
12 | 143b5b871231 |
13 | 74467134cb2 |
14 | 36d1a916ca9 |
15 | 1b47b129131 |
hex | eb6a528f05 |
1011101110021 has 8 divisors (see below), whose sum is σ = 1055888262144. Its totient is φ = 966382810800.
The previous prime is 1011101109983. The next prime is 1011101110027. The reversal of 1011101110021 is 1200111011101.
1011101110021 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1011101110021 - 217 = 1011100978949 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011101110027) 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, 17183205 + ... + 17241946.
It is an arithmetic number, because the mean of its divisors is an integer number (131986032768).
Almost surely, 21011101110021 is an apocalyptic number.
It is an amenable number.
1011101110021 is a deficient number, since it is larger than the sum of its proper divisors (44787152123).
1011101110021 is a wasteful number, since it uses less digits than its factorization.
1011101110021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34426451.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 1011101110021 its reverse (1200111011101), we get a palindrome (2211212121122).
The spelling of 1011101110021 in words is "one trillion, eleven billion, one hundred one million, one hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •