Base | Representation |
---|---|
bin | 10011000100110… |
… | …111101111101101 |
3 | 211022012220211222 |
4 | 103010313233231 |
5 | 1123412402023 |
6 | 51431353125 |
7 | 10634220632 |
oct | 2304675755 |
9 | 738186758 |
10 | 320044013 |
11 | 154724893 |
12 | 8b2227a5 |
13 | 513c8273 |
14 | 30710189 |
15 | 1d16ccc8 |
hex | 13137bed |
320044013 has 4 divisors (see below), whose sum is σ = 320599260. Its totient is φ = 319488768.
The previous prime is 320044007. The next prime is 320044027. The reversal of 320044013 is 310440023.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 153685609 + 166358404 = 12397^2 + 12898^2 .
It is a cyclic number.
It is not a de Polignac number, because 320044013 - 220 = 318995437 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 320043982 and 320044000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (320044063) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 276758 + ... + 277911.
It is an arithmetic number, because the mean of its divisors is an integer number (80149815).
Almost surely, 2320044013 is an apocalyptic number.
It is an amenable number.
320044013 is a deficient number, since it is larger than the sum of its proper divisors (555247).
320044013 is an equidigital number, since it uses as much as digits as its factorization.
320044013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 555246.
The product of its (nonzero) digits is 288, while the sum is 17.
The square root of 320044013 is about 17889.7739784493. The cubic root of 320044013 is about 684.0217360545.
Adding to 320044013 its reverse (310440023), we get a palindrome (630484036).
The spelling of 320044013 in words is "three hundred twenty million, forty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •