Base | Representation |
---|---|
bin | 1010000000010010100100… |
… | …1000000110000101101001 |
3 | 1102221121011222010211212211 |
4 | 2200010221020012011221 |
5 | 2420211201403424001 |
6 | 35221213213205121 |
7 | 2213505522512266 |
oct | 240045110060551 |
9 | 42847158124784 |
10 | 11000101233001 |
11 | 3561131412851 |
12 | 1297a877907a1 |
13 | 61a3c73a9b3a |
14 | 2a059cba826d |
15 | 141210504351 |
hex | a0129206169 |
11000101233001 has 8 divisors (see below), whose sum is σ = 11012625925704. Its totient is φ = 10987579827840.
The previous prime is 11000101232971. The next prime is 11000101233013. The reversal of 11000101233001 is 10033210100011.
It can be written as a sum of positive squares in 4 ways, for example, as 1307308677376 + 9692792555625 = 1143376^2 + 3113325^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11000101233001 - 215 = 11000101200233 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11000101233601) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5905221 + ... + 7541341.
It is an arithmetic number, because the mean of its divisors is an integer number (1376578240713).
Almost surely, 211000101233001 is an apocalyptic number.
It is an amenable number.
11000101233001 is a deficient number, since it is larger than the sum of its proper divisors (12524692703).
11000101233001 is a wasteful number, since it uses less digits than its factorization.
11000101233001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1643771.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 11000101233001 its reverse (10033210100011), we get a palindrome (21033311333012).
The spelling of 11000101233001 in words is "eleven trillion, one hundred one million, two hundred thirty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.132 sec. • engine limits •