Base | Representation |
---|---|
bin | 11001000000101110011010… |
… | …100110000111001011100001 |
3 | 112102110222210220021221010220 |
4 | 121000232122212013023201 |
5 | 103404224022240200001 |
6 | 1025541432352513253 |
7 | 32112211231651464 |
oct | 3100563246071341 |
9 | 472428726257126 |
10 | 110001001100001 |
11 | 32060187445470 |
12 | 10406b2084b829 |
13 | 494c08580521b |
14 | 1d24110c972db |
15 | cab5a255ec36 |
hex | 640b9a9872e1 |
110001001100001 has 32 divisors (see below), whose sum is σ = 161230328064000. Its totient is φ = 66156104748480.
The previous prime is 110001001099999. The next prime is 110001001100017. The reversal of 110001001100001 is 100001100100011.
It is not a de Polignac number, because 110001001100001 - 21 = 110001001099999 is a prime.
It is not an unprimeable number, because it can be changed into a prime (110001001100021) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5657151 + ... + 15874676.
It is an arithmetic number, because the mean of its divisors is an integer number (5038447752000).
Almost surely, 2110001001100001 is an apocalyptic number.
110001001100001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
110001001100001 is a deficient number, since it is larger than the sum of its proper divisors (51229326963999).
110001001100001 is a wasteful number, since it uses less digits than its factorization.
110001001100001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21533029.
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 110001001100001 its reverse (100001100100011), we get a palindrome (210002101200012).
It can be divided in two parts, 11000 and 1001100001, that added together give a palindrome (1001111001).
The spelling of 110001001100001 in words is "one hundred ten trillion, one billion, one million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •