Base | Representation |
---|---|
bin | 1010000000111011100010… |
… | …1101000110011000010001 |
3 | 1102222122120111021121110221 |
4 | 2200032320231012120101 |
5 | 2420401213100310001 |
6 | 35230232435153041 |
7 | 2214345215542450 |
oct | 240167055063021 |
9 | 42878514247427 |
10 | 11011100010001 |
11 | 35658659957a3 |
12 | 129a037145781 |
13 | 61b45ac96900 |
14 | 2a0d2383ab97 |
15 | 141655e011a1 |
hex | a03b8b46611 |
11011100010001 has 48 divisors (see below), whose sum is σ = 13688177472000. Its totient is φ = 8672725361664.
The previous prime is 11011100009971. The next prime is 11011100010007. The reversal of 11011100010001 is 10001000111011.
It is a happy number.
It is not a de Polignac number, because 11011100010001 - 213 = 11011100001809 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11011100010007) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1314440125 + ... + 1314448501.
It is an arithmetic number, because the mean of its divisors is an integer number (285170364000).
Almost surely, 211011100010001 is an apocalyptic number.
It is an amenable number.
11011100010001 is a deficient number, since it is larger than the sum of its proper divisors (2677077461999).
11011100010001 is a wasteful number, since it uses less digits than its factorization.
11011100010001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13298 (or 13285 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 11011100010001 its reverse (10001000111011), we get a palindrome (21012100121012).
It can be divided in two parts, 11011 and 100010001, that multiplied together give a palindrome (1101210121011).
The spelling of 11011100010001 in words is "eleven trillion, eleven billion, one hundred million, ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •