Base | Representation |
---|---|
bin | 11000001111000100… |
… | …10101011111000110 |
3 | 1020120210010201112210 |
4 | 30013202111133012 |
5 | 203121400441202 |
6 | 5551034124250 |
7 | 640301410326 |
oct | 140742253706 |
9 | 36523121483 |
10 | 13011343302 |
11 | 5577622891 |
12 | 2631580686 |
13 | 12c4843b09 |
14 | 8b607d286 |
15 | 512442c6c |
hex | 3078957c6 |
13011343302 has 8 divisors (see below), whose sum is σ = 26022686616. Its totient is φ = 4337114432.
The previous prime is 13011343291. The next prime is 13011343307. The reversal of 13011343302 is 20334311031.
13011343302 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
13011343302 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13011343307) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1084278603 + ... + 1084278614.
It is an arithmetic number, because the mean of its divisors is an integer number (3252835827).
Almost surely, 213011343302 is an apocalyptic number.
13011343302 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13011343302 is a wasteful number, since it uses less digits than its factorization.
13011343302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2168557222.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 13011343302 its reverse (20334311031), we get a palindrome (33345654333).
The spelling of 13011343302 in words is "thirteen billion, eleven million, three hundred forty-three thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •