Base | Representation |
---|---|
bin | 1100000110001110100100… |
… | …1111111100111000110111 |
3 | 1202002120112202112012022112 |
4 | 3001203221033330320313 |
5 | 3220411204244140203 |
6 | 44142242232521235 |
7 | 2541655310504510 |
oct | 301435117747067 |
9 | 52076482465275 |
10 | 13301132021303 |
11 | 4268a842a2395 |
12 | 15a9a2225021b |
13 | 7563a31999c9 |
14 | 33dac763da07 |
15 | 180ed64046d8 |
hex | c18e93fce37 |
13301132021303 has 4 divisors (see below), whose sum is σ = 15201293738640. Its totient is φ = 11400970303968.
The previous prime is 13301132021297. The next prime is 13301132021363. The reversal of 13301132021303 is 30312023110331.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 13301132021303 - 240 = 12201620393527 is a prime.
It is a super-2 number, since 2×133011320213032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13301132021363) 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, 950080858658 + ... + 950080858671.
It is an arithmetic number, because the mean of its divisors is an integer number (3800323434660).
Almost surely, 213301132021303 is an apocalyptic number.
13301132021303 is a deficient number, since it is larger than the sum of its proper divisors (1900161717337).
13301132021303 is an equidigital number, since it uses as much as digits as its factorization.
13301132021303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1900161717336.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 13301132021303 its reverse (30312023110331), we get a palindrome (43613155131634).
The spelling of 13301132021303 in words is "thirteen trillion, three hundred one billion, one hundred thirty-two million, twenty-one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •