Base | Representation |
---|---|
bin | 1011010000000011… |
… | …0111010010000001 |
3 | 21210110220021002002 |
4 | 2310000313102001 |
5 | 22141123002223 |
6 | 1215403433345 |
7 | 134561433032 |
oct | 26400672201 |
9 | 7713807062 |
10 | 3020125313 |
11 | 130a866937 |
12 | 703525855 |
13 | 39190c9ca |
14 | 209164a89 |
15 | 12a21be28 |
hex | b4037481 |
3020125313 has 8 divisors (see below), whose sum is σ = 3100696200. Its totient is φ = 2939883520.
The previous prime is 3020125261. The next prime is 3020125321. The reversal of 3020125313 is 3135210203.
It can be written as a sum of positive squares in 4 ways, for example, as 663217009 + 2356908304 = 25753^2 + 48548^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 3020125313 - 212 = 3020121217 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (3020125363) 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, 63620 + ... + 100437.
It is an arithmetic number, because the mean of its divisors is an integer number (387587025).
Almost surely, 23020125313 is an apocalyptic number.
It is an amenable number.
3020125313 is a deficient number, since it is larger than the sum of its proper divisors (80570887).
3020125313 is a wasteful number, since it uses less digits than its factorization.
3020125313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 164547.
The product of its (nonzero) digits is 540, while the sum is 20.
The square root of 3020125313 is about 54955.6667960639. Note that the first 3 decimals coincide. The cubic root of 3020125313 is about 1445.4674657623.
Adding to 3020125313 its reverse (3135210203), we get a palindrome (6155335516).
The spelling of 3020125313 in words is "three billion, twenty million, one hundred twenty-five thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •