Base | Representation |
---|---|
bin | 1010000000010011010111… |
… | …0001000100010000100001 |
3 | 1102221121201202011222010011 |
4 | 2200010311301010100201 |
5 | 2420212120201100001 |
6 | 35221250230404521 |
7 | 2213514006165364 |
oct | 240046561042041 |
9 | 42847652158104 |
10 | 11000313300001 |
11 | 3561230097933 |
12 | 1297b26800741 |
13 | 61a42c2ca77c |
14 | 2a05bd00c0db |
15 | 141223e43d51 |
hex | a0135c44421 |
11000313300001 has 4 divisors (see below), whose sum is σ = 11028021898132. Its totient is φ = 10972604701872.
The previous prime is 11000313299981. The next prime is 11000313300019. The reversal of 11000313300001 is 10000331300011.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 9352440446976 + 1647872853025 = 3058176^2 + 1283695^2 .
It is a cyclic number.
It is not a de Polignac number, because 11000313300001 - 225 = 11000279745569 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11000313300071) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13854298470 + ... + 13854299263.
It is an arithmetic number, because the mean of its divisors is an integer number (2757005474533).
Almost surely, 211000313300001 is an apocalyptic number.
It is an amenable number.
11000313300001 is a deficient number, since it is larger than the sum of its proper divisors (27708598131).
11000313300001 is an equidigital number, since it uses as much as digits as its factorization.
11000313300001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27708598130.
The product of its (nonzero) digits is 27, while the sum is 13.
Adding to 11000313300001 its reverse (10000331300011), we get a palindrome (21000644600012).
The spelling of 11000313300001 in words is "eleven trillion, three hundred thirteen million, three hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •