Base | Representation |
---|---|
bin | 10011001101100011011… |
… | …011001100001101000011 |
3 | 11200012201121112221001012 |
4 | 103031203123030031003 |
5 | 133112304044012011 |
6 | 2450300241231135 |
7 | 164245233420623 |
oct | 23154333141503 |
9 | 4605647487035 |
10 | 1320223032131 |
11 | 4699a3535593 |
12 | 193a500324ab |
13 | 9765ba61943 |
14 | 47c8332a883 |
15 | 2451e549a8b |
hex | 133636cc343 |
1320223032131 has 32 divisors (see below), whose sum is σ = 1399132320768. Its totient is φ = 1243261071360.
The previous prime is 1320223032097. The next prime is 1320223032133. The reversal of 1320223032131 is 1312303220231.
It is a cyclic number.
It is not a de Polignac number, because 1320223032131 - 26 = 1320223032067 is a prime.
It is a super-2 number, since 2×13202230321312 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a junction number, because it is equal to n+sod(n) for n = 1320223032097 and 1320223032106.
It is not an unprimeable number, because it can be changed into a prime (1320223032133) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 378177296 + ... + 378180786.
It is an arithmetic number, because the mean of its divisors is an integer number (43722885024).
Almost surely, 21320223032131 is an apocalyptic number.
1320223032131 is a deficient number, since it is larger than the sum of its proper divisors (78909288637).
1320223032131 is a wasteful number, since it uses less digits than its factorization.
1320223032131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4451.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 1320223032131 its reverse (1312303220231), we get a palindrome (2632526252362).
The spelling of 1320223032131 in words is "one trillion, three hundred twenty billion, two hundred twenty-three million, thirty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •