Base | Representation |
---|---|
bin | 1100000000010111001001… |
… | …0100010100110010111101 |
3 | 1201201221102020221120121202 |
4 | 3000011302110110302331 |
5 | 3212233310210300133 |
6 | 44024054100305245 |
7 | 2531460016230026 |
oct | 300056224246275 |
9 | 51657366846552 |
10 | 13200352431293 |
11 | 422a2688a6825 |
12 | 15923973a2225 |
13 | 749a32002301 |
14 | 338c86c47c4d |
15 | 17d588a252e8 |
hex | c0172514cbd |
13200352431293 has 4 divisors (see below), whose sum is σ = 13252943477088. Its totient is φ = 13147761385500.
The previous prime is 13200352431281. The next prime is 13200352431319. The reversal of 13200352431293 is 39213425300231.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 13200352431293 - 228 = 13200083995837 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 (13200352439293) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 26295522521 + ... + 26295523022.
It is an arithmetic number, because the mean of its divisors is an integer number (3313235869272).
Almost surely, 213200352431293 is an apocalyptic number.
It is an amenable number.
13200352431293 is a deficient number, since it is larger than the sum of its proper divisors (52591045795).
13200352431293 is an equidigital number, since it uses as much as digits as its factorization.
13200352431293 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52591045794.
The product of its (nonzero) digits is 116640, while the sum is 38.
The spelling of 13200352431293 in words is "thirteen trillion, two hundred billion, three hundred fifty-two million, four hundred thirty-one thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •