Base | Representation |
---|---|
bin | 1010000000010011011000… |
… | …1110011100011101100001 |
3 | 1102221121202021200020022221 |
4 | 2200010312032130131201 |
5 | 2420212124134020223 |
6 | 35221251103431041 |
7 | 2213514131512240 |
oct | 240046616343541 |
9 | 42847667606287 |
10 | 11000321001313 |
11 | 3561234477a56 |
12 | 1297b292b5481 |
13 | 61a430a95c67 |
14 | 2a05c0054957 |
15 | 141224965b5d |
hex | a013639c761 |
11000321001313 has 8 divisors (see below), whose sum is σ = 13233468873920. Its totient is φ = 8932591489680.
The previous prime is 11000321001281. The next prime is 11000321001359. The reversal of 11000321001313 is 31310012300011.
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 11000321001313 - 25 = 11000321001281 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11000321001413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 41354590098 + ... + 41354590363.
It is an arithmetic number, because the mean of its divisors is an integer number (1654183609240).
Almost surely, 211000321001313 is an apocalyptic number.
It is an amenable number.
11000321001313 is a deficient number, since it is larger than the sum of its proper divisors (2233147872607).
11000321001313 is an equidigital number, since it uses as much as digits as its factorization.
11000321001313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82709180487.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 11000321001313 its reverse (31310012300011), we get a palindrome (42310333301324).
The spelling of 11000321001313 in words is "eleven trillion, three hundred twenty-one million, one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •