Base | Representation |
---|---|
bin | 10000000001011110101… |
… | …111000001100011010001 |
3 | 10220021010121211000220110 |
4 | 100001132233001203101 |
5 | 121020023324410301 |
6 | 2201501104031533 |
7 | 142360211120400 |
oct | 20013657014321 |
9 | 3807117730813 |
10 | 1101101013201 |
11 | 394a798a8562 |
12 | 1594986025a9 |
13 | 7caaac22187 |
14 | 3b4177cb637 |
15 | 1d9974870d6 |
hex | 1005ebc18d1 |
1101101013201 has 48 divisors (see below), whose sum is σ = 1760304325824. Its totient is φ = 610081629696.
The previous prime is 1101101013101. The next prime is 1101101013269. The reversal of 1101101013201 is 1023101011011.
It is not a de Polignac number, because 1101101013201 - 27 = 1101101013073 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1101101013101) 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 47 ways as a sum of consecutive naturals, for example, 230221 + ... + 1501733.
It is an arithmetic number, because the mean of its divisors is an integer number (36673006788).
Almost surely, 21101101013201 is an apocalyptic number.
It is an amenable number.
1101101013201 is a deficient number, since it is larger than the sum of its proper divisors (659203312623).
1101101013201 is a wasteful number, since it uses less digits than its factorization.
1101101013201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1271710 (or 1271703 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 12.
Adding to 1101101013201 its reverse (1023101011011), we get a palindrome (2124202024212).
The spelling of 1101101013201 in words is "one trillion, one hundred one billion, one hundred one million, thirteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •