Base | Representation |
---|---|
bin | 10011001101011100001… |
… | …010110110111000111011 |
3 | 11200012102010111210200112 |
4 | 103031130022312320323 |
5 | 133112031413410021 |
6 | 2450240212254535 |
7 | 164242224664631 |
oct | 23153412667073 |
9 | 4605363453615 |
10 | 1320101310011 |
11 | 4699408579a0 |
12 | 193a1731144b |
13 | 9763c783c13 |
14 | 47c710c3351 |
15 | 24513a03d5b |
hex | 1335c2b6e3b |
1320101310011 has 16 divisors (see below), whose sum is σ = 1468217415168. Its totient is φ = 1176698546400.
The previous prime is 1320101309963. The next prime is 1320101310091. The reversal of 1320101310011 is 1100131010231.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1320101310011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1320101310091) 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 15 ways as a sum of consecutive naturals, for example, 195230 + ... + 1636556.
It is an arithmetic number, because the mean of its divisors is an integer number (91763588448).
Almost surely, 21320101310011 is an apocalyptic number.
1320101310011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1320101310011 is a deficient number, since it is larger than the sum of its proper divisors (148116105157).
1320101310011 is a wasteful number, since it uses less digits than its factorization.
1320101310011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1442962.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 1320101310011 its reverse (1100131010231), we get a palindrome (2420232320242).
The spelling of 1320101310011 in words is "one trillion, three hundred twenty billion, one hundred one million, three hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •