Base | Representation |
---|---|
bin | 1001000110001001000000… |
… | …0101000010101110111111 |
3 | 1022102002120221011020110012 |
4 | 2101202100011002232333 |
5 | 2302324223340343421 |
6 | 33134235321333435 |
7 | 2051361415525223 |
oct | 221422005025677 |
9 | 38362527136405 |
10 | 10001101106111 |
11 | 3206496934375 |
12 | 115634463727b |
13 | 57713b3057bb |
14 | 2680ad478783 |
15 | 12524194695b |
hex | 91890142bbf |
10001101106111 has 8 divisors (see below), whose sum is σ = 10246104817200. Its totient is φ = 9756148557760.
The previous prime is 10001101106083. The next prime is 10001101106119. The reversal of 10001101106111 is 11160110110001.
It is a happy number.
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 10001101106111 - 26 = 10001101106047 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 (10001101106119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12394796 + ... + 13176993.
It is an arithmetic number, because the mean of its divisors is an integer number (1280763102150).
Almost surely, 210001101106111 is an apocalyptic number.
10001101106111 is a deficient number, since it is larger than the sum of its proper divisors (245003711089).
10001101106111 is an equidigital number, since it uses as much as digits as its factorization.
10001101106111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25581369.
The product of its (nonzero) digits is 6, while the sum is 14.
Adding to 10001101106111 its reverse (11160110110001), we get a palindrome (21161211216112).
The spelling of 10001101106111 in words is "ten trillion, one billion, one hundred one million, one hundred six thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •