Base | Representation |
---|---|
bin | 1001001100100010011010… |
… | …1000010000001100101101 |
3 | 1022210121021001101102202000 |
4 | 2103020212220100030231 |
5 | 2311124312240213401 |
6 | 33300532455522513 |
7 | 2062332014212665 |
oct | 223104650201455 |
9 | 38717231342660 |
10 | 10111001101101 |
11 | 324906258a20a |
12 | 11736b5989439 |
13 | 584603b89834 |
14 | 26d5372691a5 |
15 | 128024d88186 |
hex | 93226a1032d |
10111001101101 has 16 divisors (see below), whose sum is σ = 15860393884800. Its totient is φ = 6344157553344.
The previous prime is 10111001101087. The next prime is 10111001101111. The reversal of 10111001101101 is 10110110011101.
It is not a de Polignac number, because 10111001101101 - 210 = 10111001100077 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 (10111001101111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11014161961 + ... + 11014162878.
It is an arithmetic number, because the mean of its divisors is an integer number (991274617800).
Almost surely, 210111001101101 is an apocalyptic number.
It is an amenable number.
10111001101101 is a deficient number, since it is larger than the sum of its proper divisors (5749392783699).
10111001101101 is a wasteful number, since it uses less digits than its factorization.
10111001101101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22028324865 (or 22028324859 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 10111001101101 its reverse (10110110011101), we get a palindrome (20221111112202).
The spelling of 10111001101101 in words is "ten trillion, one hundred eleven billion, one million, one hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •