Base | Representation |
---|---|
bin | 10010111101101110101… |
… | …011111011111101000101 |
3 | 11121120212111010020221112 |
4 | 102331232223323331011 |
5 | 132323004404232323 |
6 | 2434410242454405 |
7 | 163104210044036 |
oct | 22755653737505 |
9 | 4546774106845 |
10 | 1303232102213 |
11 | 462774601448 |
12 | 1906a9964405 |
13 | 95b818c5a62 |
14 | 4711092ca8d |
15 | 23d77a65178 |
hex | 12f6eafbf45 |
1303232102213 has 8 divisors (see below), whose sum is σ = 1338751340568. Its totient is φ = 1267728482304.
The previous prime is 1303232102143. The next prime is 1303232102243. The reversal of 1303232102213 is 3122012323031.
It can be written as a sum of positive squares in 4 ways, for example, as 410704103044 + 892527999169 = 640862^2 + 944737^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1303232102213 - 28 = 1303232101957 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1303232102243) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3735356 + ... + 4069317.
It is an arithmetic number, because the mean of its divisors is an integer number (167343917571).
Almost surely, 21303232102213 is an apocalyptic number.
It is an amenable number.
1303232102213 is a deficient number, since it is larger than the sum of its proper divisors (35519238355).
1303232102213 is an equidigital number, since it uses as much as digits as its factorization.
1303232102213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7809223.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 1303232102213 its reverse (3122012323031), we get a palindrome (4425244425244).
The spelling of 1303232102213 in words is "one trillion, three hundred three billion, two hundred thirty-two million, one hundred two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •