Base | Representation |
---|---|
bin | 1001001001000001000011… |
… | …00011111011001111011101 |
3 | 2122011122012221121201200000 |
4 | 10210200201203323033131 |
5 | 10113313332030323401 |
6 | 110430135421124513 |
7 | 4143151523655105 |
oct | 444404143731735 |
9 | 78148187551600 |
10 | 20101010011101 |
11 | 644a877134458 |
12 | 23078636b9739 |
13 | b2a695127286 |
14 | 4d6c734b4205 |
15 | 24cd17acd186 |
hex | 1248218fb3dd |
20101010011101 has 12 divisors (see below), whose sum is σ = 30110154914112. Its totient is φ = 13400673340572.
The previous prime is 20101010011073. The next prime is 20101010011109. The reversal of 20101010011101 is 10111001010102.
It is not a de Polignac number, because 20101010011101 - 211 = 20101010009053 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 (20101010011109) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 41360102661 + ... + 41360103146.
It is an arithmetic number, because the mean of its divisors is an integer number (2509179576176).
Almost surely, 220101010011101 is an apocalyptic number.
It is an amenable number.
20101010011101 is a deficient number, since it is larger than the sum of its proper divisors (10009144903011).
20101010011101 is an frugal number, since it uses more digits than its factorization.
20101010011101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 82720205822 (or 82720205810 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 20101010011101 its reverse (10111001010102), we get a palindrome (30212011021203).
Subtracting from 20101010011101 its reverse (10111001010102), we obtain a palindrome (9990009000999).
The spelling of 20101010011101 in words is "twenty trillion, one hundred one billion, ten million, eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •