Base | Representation |
---|---|
bin | 1100000110001110001010… |
… | …0100101000101110001101 |
3 | 1202002120020221202002101101 |
4 | 3001203202210220232031 |
5 | 3220410442110100323 |
6 | 44142223151543101 |
7 | 2541652450406245 |
oct | 301434244505615 |
9 | 52076227662341 |
10 | 13301020003213 |
11 | 4268a27042558 |
12 | 15a99b082aa91 |
13 | 756385c08c07 |
14 | 33dab6800b25 |
15 | 180ecb678dad |
hex | c18e2928b8d |
13301020003213 has 8 divisors (see below), whose sum is σ = 13879382995008. Its totient is φ = 12722661825984.
The previous prime is 13301020003211. The next prime is 13301020003267. The reversal of 13301020003213 is 31230002010331.
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 13301020003213 - 21 = 13301020003211 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 (13301020003211) 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 7 ways as a sum of consecutive naturals, for example, 5157045 + ... + 7293637.
It is an arithmetic number, because the mean of its divisors is an integer number (1734922874376).
Almost surely, 213301020003213 is an apocalyptic number.
It is an amenable number.
13301020003213 is a deficient number, since it is larger than the sum of its proper divisors (578362991795).
13301020003213 is a wasteful number, since it uses less digits than its factorization.
13301020003213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2407283.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 13301020003213 its reverse (31230002010331), we get a palindrome (44531022013544).
The spelling of 13301020003213 in words is "thirteen trillion, three hundred one billion, twenty million, three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •