Base | Representation |
---|---|
bin | 100110110011011… |
… | …1011010011011101 |
3 | 10100202000222211120 |
4 | 1031212323103131 |
5 | 10131311100023 |
6 | 333111241153 |
7 | 44160146115 |
oct | 11546732335 |
9 | 3322028746 |
10 | 1302050013 |
11 | 608a784a0 |
12 | 3040791b9 |
13 | 1799a50c4 |
14 | c4cd6045 |
15 | 794978e3 |
hex | 4d9bb4dd |
1302050013 has 8 divisors (see below), whose sum is σ = 1893890976. Its totient is φ = 789121200.
The previous prime is 1302050011. The next prime is 1302050021. The reversal of 1302050013 is 3100502031.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1302050013 - 21 = 1302050011 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1302049974 and 1302050001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1302050011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19727998 + ... + 19728063.
It is an arithmetic number, because the mean of its divisors is an integer number (236736372).
Almost surely, 21302050013 is an apocalyptic number.
It is an amenable number.
1302050013 is a deficient number, since it is larger than the sum of its proper divisors (591840963).
1302050013 is a wasteful number, since it uses less digits than its factorization.
1302050013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39456075.
The product of its (nonzero) digits is 90, while the sum is 15.
The square root of 1302050013 is about 36083.9301213158. The cubic root of 1302050013 is about 1091.9662662834.
Adding to 1302050013 its reverse (3100502031), we get a palindrome (4402552044).
The spelling of 1302050013 in words is "one billion, three hundred two million, fifty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •