Base | Representation |
---|---|
bin | 1100000111100001001100… |
… | …1010001111010000001101 |
3 | 1202011200210101022102001221 |
4 | 3001320103022033100031 |
5 | 3221242114330100323 |
6 | 44200351044003341 |
7 | 2543402020315060 |
oct | 301702312172015 |
9 | 52150711272057 |
10 | 13323310003213 |
11 | 4277425182461 |
12 | 15b2191690551 |
13 | 7584c8b67122 |
14 | 340bcccb08d7 |
15 | 18188348d55d |
hex | c1e1328f40d |
13323310003213 has 8 divisors (see below), whose sum is σ = 15227178673280. Its totient is φ = 11419576000560.
The previous prime is 13323310003189. The next prime is 13323310003217. The reversal of 13323310003213 is 31230001332331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-13323310003213 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13323310003217) 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, 33454758 + ... + 33850663.
It is an arithmetic number, because the mean of its divisors is an integer number (1903397334160).
Almost surely, 213323310003213 is an apocalyptic number.
It is an amenable number.
13323310003213 is a deficient number, since it is larger than the sum of its proper divisors (1903868670067).
13323310003213 is an equidigital number, since it uses as much as digits as its factorization.
13323310003213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67333707.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 13323310003213 its reverse (31230001332331), we get a palindrome (44553311335544).
The spelling of 13323310003213 in words is "thirteen trillion, three hundred twenty-three billion, three hundred ten million, three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •