Base | Representation |
---|---|
bin | 10000000001101011001… |
… | …101011101110101111111 |
3 | 10220021200012122220212002 |
4 | 100001223031131311333 |
5 | 121020440420214444 |
6 | 2201533542132515 |
7 | 142365332156321 |
oct | 20015315356577 |
9 | 3807605586762 |
10 | 1101310319999 |
11 | 395076a6788a |
12 | 15953672113b |
13 | 7cb123b7656 |
14 | 3b437513611 |
15 | 1d9aaa2dd4e |
hex | 1006b35dd7f |
1101310319999 has 4 divisors (see below), whose sum is σ = 1139286537960. Its totient is φ = 1063334102040.
The previous prime is 1101310319957. The next prime is 1101310320013. The reversal of 1101310319999 is 9999130131011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1101310319999 - 232 = 1097015352703 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101310319939) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18988108937 + ... + 18988108994.
It is an arithmetic number, because the mean of its divisors is an integer number (284821634490).
Almost surely, 21101310319999 is an apocalyptic number.
1101310319999 is a deficient number, since it is larger than the sum of its proper divisors (37976217961).
1101310319999 is an equidigital number, since it uses as much as digits as its factorization.
1101310319999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37976217960.
The product of its (nonzero) digits is 59049, while the sum is 47.
The spelling of 1101310319999 in words is "one trillion, one hundred one billion, three hundred ten million, three hundred nineteen thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •