Base | Representation |
---|---|
bin | 10011001101011000101… |
… | …100111101101110000101 |
3 | 11200012021002001120012112 |
4 | 103031120230331232011 |
5 | 133111422021021041 |
6 | 2450230333430405 |
7 | 164240620400642 |
oct | 23153054755605 |
9 | 4605232046175 |
10 | 1320043142021 |
11 | 469910a3847a |
12 | 1939bb93b405 |
13 | 976306c8aa6 |
14 | 47c674a0dc9 |
15 | 2450d863deb |
hex | 13358b3db85 |
1320043142021 has 4 divisors (see below), whose sum is σ = 1331724939852. Its totient is φ = 1308361344192.
The previous prime is 1320043141999. The next prime is 1320043142051. The reversal of 1320043142021 is 1202413400231.
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 369525388996 + 950517753025 = 607886^2 + 974945^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1320043142021 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 (1320043142051) 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, 5840898746 + ... + 5840898971.
It is an arithmetic number, because the mean of its divisors is an integer number (332931234963).
Almost surely, 21320043142021 is an apocalyptic number.
It is an amenable number.
1320043142021 is a deficient number, since it is larger than the sum of its proper divisors (11681797831).
1320043142021 is a wasteful number, since it uses less digits than its factorization.
1320043142021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11681797830.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 1320043142021 its reverse (1202413400231), we get a palindrome (2522456542252).
The spelling of 1320043142021 in words is "one trillion, three hundred twenty billion, forty-three million, one hundred forty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •