Base | Representation |
---|---|
bin | 1001000110000100111100… |
… | …0110100111110100001101 |
3 | 1022101222202221221011111120 |
4 | 2101201033012213310031 |
5 | 2302320010304013401 |
6 | 33133535220511153 |
7 | 2051322411013422 |
oct | 221411706476415 |
9 | 38358687834446 |
10 | 10000011001101 |
11 | 3205a87568340 |
12 | 115609b54b4b9 |
13 | 576cc650a954 |
14 | 268008793d49 |
15 | 1251cadb7836 |
hex | 9184f1a7d0d |
10000011001101 has 16 divisors (see below), whose sum is σ = 15311021629440. Its totient is φ = 5741633110320.
The previous prime is 10000011001061. The next prime is 10000011001117. The reversal of 10000011001101 is 10110011000001.
It is not a de Polignac number, because 10000011001101 - 223 = 10000002612493 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 10000011001101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10000011001121) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7974489805 + ... + 7974491058.
It is an arithmetic number, because the mean of its divisors is an integer number (956938851840).
Almost surely, 210000011001101 is an apocalyptic number.
10000011001101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10000011001101 is a deficient number, since it is larger than the sum of its proper divisors (5311010628339).
10000011001101 is a wasteful number, since it uses less digits than its factorization.
10000011001101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15948980896.
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 10000011001101 its reverse (10110011000001), we get a palindrome (20110022001102).
The spelling of 10000011001101 in words is "ten trillion, eleven million, one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •