Base | Representation |
---|---|
bin | 11000010000001001… |
… | …00101111000001101 |
3 | 1020121102000221211211 |
4 | 30020010211320031 |
5 | 203131200321331 |
6 | 5551554414421 |
7 | 640440631234 |
oct | 141004457015 |
9 | 36542027754 |
10 | 13020323341 |
11 | 55816a6703 |
12 | 2634591411 |
13 | 12c666934c |
14 | 8b7339b1b |
15 | 5131188b1 |
hex | 308125e0d |
13020323341 has 8 divisors (see below), whose sum is σ = 13837479480. Its totient is φ = 12208862208.
The previous prime is 13020323317. The next prime is 13020323359. The reversal of 13020323341 is 14332302031.
It can be written as a sum of positive squares in 4 ways, for example, as 289714441 + 12730608900 = 17021^2 + 112830^2 .
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 13020323341 - 27 = 13020323213 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 (13020323741) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1419036 + ... + 1428181.
It is an arithmetic number, because the mean of its divisors is an integer number (1729684935).
Almost surely, 213020323341 is an apocalyptic number.
It is an amenable number.
13020323341 is a deficient number, since it is larger than the sum of its proper divisors (817156139).
13020323341 is a wasteful number, since it uses less digits than its factorization.
13020323341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2847503.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 13020323341 its reverse (14332302031), we get a palindrome (27352625372).
The spelling of 13020323341 in words is "thirteen billion, twenty million, three hundred twenty-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.034 sec. • engine limits •