Base | Representation |
---|---|
bin | 1100000111100011110001… |
… | …0010010111111111011101 |
3 | 1202011202120110122222111001 |
4 | 3001320330102113333131 |
5 | 3221300023000031023 |
6 | 44200543333030301 |
7 | 2543425066233301 |
oct | 301707422277735 |
9 | 52152513588431 |
10 | 13324000002013 |
11 | 42777497107a8 |
12 | 15b2344785391 |
13 | 7585a8ab423c |
14 | 340c567a3d01 |
15 | 1818c3d376ad |
hex | c1e3c497fdd |
13324000002013 has 8 divisors (see below), whose sum is σ = 13326213017816. Its totient is φ = 13321787169600.
The previous prime is 13324000001927. The next prime is 13324000002023. The reversal of 13324000002013 is 31020000042331.
It can be written as a sum of positive squares in 4 ways, for example, as 1875264576409 + 11448735425604 = 1369403^2 + 3383598^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13324000002013 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 (13324000002023) 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, 233968123 + ... + 234025063.
It is an arithmetic number, because the mean of its divisors is an integer number (1665776627227).
Almost surely, 213324000002013 is an apocalyptic number.
It is an amenable number.
13324000002013 is a deficient number, since it is larger than the sum of its proper divisors (2213015803).
13324000002013 is an equidigital number, since it uses as much as digits as its factorization.
13324000002013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 91695.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 13324000002013 its reverse (31020000042331), we get a palindrome (44344000044344).
The spelling of 13324000002013 in words is "thirteen trillion, three hundred twenty-four billion, two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •