Base | Representation |
---|---|
bin | 1001001011111001110110… |
… | …0010001100100001101011 |
3 | 1022202120011002221001122022 |
4 | 2102332131202030201223 |
5 | 2310440011420200021 |
6 | 33251532121215055 |
7 | 2061465111555452 |
oct | 222763542144153 |
9 | 38676132831568 |
10 | 10100111100011 |
11 | 3244484452209 |
12 | 117157693148b |
13 | 583589996bca |
14 | 26cbc2c2db99 |
15 | 127ad8cc61ab |
hex | 92f9d88c86b |
10100111100011 has 8 divisors (see below), whose sum is σ = 10521818924400. Its totient is φ = 9686753925760.
The previous prime is 10100111099989. The next prime is 10100111100019. The reversal of 10100111100011 is 11000111100101.
10100111100011 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 a de Polignac number, because none of the positive numbers 2k-10100111100011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10100111100019) 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, 2087660066 + ... + 2087664903.
It is an arithmetic number, because the mean of its divisors is an integer number (1315227365550).
Almost surely, 210100111100011 is an apocalyptic number.
10100111100011 is a deficient number, since it is larger than the sum of its proper divisors (421707824389).
10100111100011 is an equidigital number, since it uses as much as digits as its factorization.
10100111100011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4175325069.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 10100111100011 its reverse (11000111100101), we get a palindrome (21100222200112).
The spelling of 10100111100011 in words is "ten trillion, one hundred billion, one hundred eleven million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •