Base | Representation |
---|---|
bin | 11000001101111111… |
… | …10101111001010101 |
3 | 1020120011010022212012 |
4 | 30012333311321111 |
5 | 203112042113023 |
6 | 5550112234005 |
7 | 640131510062 |
oct | 140677657125 |
9 | 36504108765 |
10 | 13002301013 |
11 | 5572507219 |
12 | 262a53b905 |
13 | 12c29c9150 |
14 | 8b4ba7c69 |
15 | 511758978 |
hex | 306ff5e55 |
13002301013 has 8 divisors (see below), whose sum is σ = 14344002456. Its totient is φ = 11709388800.
The previous prime is 13002301001. The next prime is 13002301019. The reversal of 13002301013 is 31010320031.
It can be written as a sum of positive squares in 4 ways, for example, as 819218884 + 12183082129 = 28622^2 + 110377^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-13002301013 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 (13002301019) 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, 12196748 + ... + 12197813.
It is an arithmetic number, because the mean of its divisors is an integer number (1793000307).
Almost surely, 213002301013 is an apocalyptic number.
13002301013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
13002301013 is a deficient number, since it is larger than the sum of its proper divisors (1341701443).
13002301013 is a wasteful number, since it uses less digits than its factorization.
13002301013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24394615.
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 13002301013 its reverse (31010320031), we get a palindrome (44012621044).
The spelling of 13002301013 in words is "thirteen billion, two million, three hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •