Base | Representation |
---|---|
bin | 10011001101011100110… |
… | …000001101010001011111 |
3 | 11200012102210221020102121 |
4 | 103031130300031101133 |
5 | 133112041420213043 |
6 | 2450241202203411 |
7 | 164242404134101 |
oct | 23153460152137 |
9 | 4605383836377 |
10 | 1320111101023 |
11 | 469946335040 |
12 | 193a1a653567 |
13 | 97641801610 |
14 | 47c72511571 |
15 | 245147d9ded |
hex | 1335cc0d45f |
1320111101023 has 16 divisors (see below), whose sum is σ = 1551183532416. Its totient is φ = 1107582841440.
The previous prime is 1320111100999. The next prime is 1320111101033. The reversal of 1320111101023 is 3201011110231.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1320111101023 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1320111100988 and 1320111101006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1320111101033) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 57765 + ... + 1625902.
It is an arithmetic number, because the mean of its divisors is an integer number (96948970776).
Almost surely, 21320111101023 is an apocalyptic number.
1320111101023 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1320111101023 is a deficient number, since it is larger than the sum of its proper divisors (231072431393).
1320111101023 is a wasteful number, since it uses less digits than its factorization.
1320111101023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1689174.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 1320111101023 its reverse (3201011110231), we get a palindrome (4521122211254).
The spelling of 1320111101023 in words is "one trillion, three hundred twenty billion, one hundred eleven million, one hundred one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •