Base | Representation |
---|---|
bin | 11000010011101000… |
… | …01100100111100001 |
3 | 1020200110002100102211 |
4 | 30021310030213201 |
5 | 203211143030001 |
6 | 5554521442121 |
7 | 641244412513 |
oct | 141164144741 |
9 | 36613070384 |
10 | 13049580001 |
11 | 5597169667 |
12 | 2642340341 |
13 | 12cc740b93 |
14 | 8bb193bb3 |
15 | 515997351 |
hex | 309d0c9e1 |
13049580001 has 8 divisors (see below), whose sum is σ = 14043714984. Its totient is φ = 12080613120.
The previous prime is 13049579957. The next prime is 13049580007. The reversal of 13049580001 is 10008594031.
It can be written as a sum of positive squares in 4 ways, for example, as 67256401 + 12982323600 = 8201^2 + 113940^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 13049580001 - 211 = 13049577953 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13049580007) 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, 6290950 + ... + 6293023.
It is an arithmetic number, because the mean of its divisors is an integer number (1755464373).
Almost surely, 213049580001 is an apocalyptic number.
It is an amenable number.
13049580001 is a deficient number, since it is larger than the sum of its proper divisors (994134983).
13049580001 is a wasteful number, since it uses less digits than its factorization.
13049580001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12584051.
The product of its (nonzero) digits is 4320, while the sum is 31.
The spelling of 13049580001 in words is "thirteen billion, forty-nine million, five hundred eighty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.180 sec. • engine limits •