Base | Representation |
---|---|
bin | 10011001101011100110… |
… | …000111110010110000101 |
3 | 11200012102211022110010222 |
4 | 103031130300332112011 |
5 | 133112041443131041 |
6 | 2450241210354125 |
7 | 164242405632101 |
oct | 23153460762605 |
9 | 4605384273128 |
10 | 1320111302021 |
11 | 469946462056 |
12 | 193a1a72b945 |
13 | 97641871c55 |
14 | 47c72564901 |
15 | 2451482974b |
hex | 1335cc3e585 |
1320111302021 has 4 divisors (see below), whose sum is σ = 1320156508044. Its totient is φ = 1320066096000.
The previous prime is 1320111301997. The next prime is 1320111302033. The reversal of 1320111302021 is 1202031110231.
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 24807825025 + 1295303476996 = 157505^2 + 1138114^2 .
It is a cyclic number.
It is not a de Polignac number, because 1320111302021 - 238 = 1045233395077 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 (1320111302071) 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, 22559180 + ... + 22617621.
It is an arithmetic number, because the mean of its divisors is an integer number (330039127011).
Almost surely, 21320111302021 is an apocalyptic number.
It is an amenable number.
1320111302021 is a deficient number, since it is larger than the sum of its proper divisors (45206023).
1320111302021 is an equidigital number, since it uses as much as digits as its factorization.
1320111302021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45206022.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 1320111302021 its reverse (1202031110231), we get a palindrome (2522142412252).
The spelling of 1320111302021 in words is "one trillion, three hundred twenty billion, one hundred eleven million, three hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •