Base | Representation |
---|---|
bin | 10011010110111100001… |
… | …011100001010101101101 |
3 | 11201011202000222010112111 |
4 | 103112330023201111231 |
5 | 133243424304444323 |
6 | 2455044325204021 |
7 | 165053060456611 |
oct | 23267413412555 |
9 | 4634660863474 |
10 | 1330302031213 |
11 | 4731a58a77a1 |
12 | 1959a3560611 |
13 | 985a6c1ba1c |
14 | 4855bb75341 |
15 | 2490e30ec0d |
hex | 135bc2e156d |
1330302031213 has 4 divisors (see below), whose sum is σ = 1330667803900. Its totient is φ = 1329936258528.
The previous prime is 1330302031171. The next prime is 1330302031229. The reversal of 1330302031213 is 3121302030331.
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 573657789604 + 756644241609 = 757402^2 + 869853^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1330302031213 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 (1330302031243) 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, 182880888 + ... + 182888161.
It is an arithmetic number, because the mean of its divisors is an integer number (332666950975).
Almost surely, 21330302031213 is an apocalyptic number.
It is an amenable number.
1330302031213 is a deficient number, since it is larger than the sum of its proper divisors (365772687).
1330302031213 is an equidigital number, since it uses as much as digits as its factorization.
1330302031213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 365772686.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 1330302031213 its reverse (3121302030331), we get a palindrome (4451604061544).
The spelling of 1330302031213 in words is "one trillion, three hundred thirty billion, three hundred two million, thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •