Base | Representation |
---|---|
bin | 1011011110011001… |
… | …1100000101010001 |
3 | 21221200010210212101 |
4 | 2313212130011101 |
5 | 22302024311100 |
6 | 1225353400401 |
7 | 136222114645 |
oct | 26746340521 |
9 | 7850123771 |
10 | 3080307025 |
11 | 1340831294 |
12 | 71b709101 |
13 | 3a12215a3 |
14 | 21314cc25 |
15 | 13065886a |
hex | b799c151 |
3080307025 has 6 divisors (see below), whose sum is σ = 3819580742. Its totient is φ = 2464245600.
The previous prime is 3080306963. The next prime is 3080307029. The reversal of 3080307025 is 5207030803.
3080307025 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 3 ways, for example, as 35916049 + 3044390976 = 5993^2 + 55176^2 .
It is not a de Polignac number, because 3080307025 - 29 = 3080306513 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3080306984 and 3080307002.
It is not an unprimeable number, because it can be changed into a prime (3080307029) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 61606116 + ... + 61606165.
Almost surely, 23080307025 is an apocalyptic number.
It is an amenable number.
3080307025 is a deficient number, since it is larger than the sum of its proper divisors (739273717).
3080307025 is a wasteful number, since it uses less digits than its factorization.
3080307025 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 123212291 (or 123212286 counting only the distinct ones).
The product of its (nonzero) digits is 5040, while the sum is 28.
The square root of 3080307025 is about 55500.5137363610. The cubic root of 3080307025 is about 1455.0056132013.
Adding to 3080307025 its reverse (5207030803), we get a palindrome (8287337828).
The spelling of 3080307025 in words is "three billion, eighty million, three hundred seven thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •