Base | Representation |
---|---|
bin | 1011100110000011… |
… | …0111110001101001 |
3 | 22000220112101221002 |
4 | 2321200313301221 |
5 | 22333233331100 |
6 | 1232501324345 |
7 | 140061660245 |
oct | 27140676151 |
9 | 8026471832 |
10 | 3112402025 |
11 | 1357962787 |
12 | 72a4066b5 |
13 | 3a7a7b005 |
14 | 217505425 |
15 | 1333982d5 |
hex | b9837c69 |
3112402025 has 6 divisors (see below), whose sum is σ = 3859378542. Its totient is φ = 2489921600.
The previous prime is 3112402019. The next prime is 3112402057. The reversal of 3112402025 is 5202042113.
It can be written as a sum of positive squares in 3 ways, for example, as 839782441 + 2272619584 = 28979^2 + 47672^2 .
It is not a de Polignac number, because 3112402025 - 24 = 3112402009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3112401988 and 3112402006.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 62248016 + ... + 62248065.
It is an arithmetic number, because the mean of its divisors is an integer number (643229757).
Almost surely, 23112402025 is an apocalyptic number.
It is an amenable number.
3112402025 is a deficient number, since it is larger than the sum of its proper divisors (746976517).
3112402025 is a wasteful number, since it uses less digits than its factorization.
3112402025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124496091 (or 124496086 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 20.
The square root of 3112402025 is about 55788.9059311975. The cubic root of 3112402025 is about 1460.0415990211.
Adding to 3112402025 its reverse (5202042113), we get a palindrome (8314444138).
The spelling of 3112402025 in words is "three billion, one hundred twelve million, four hundred two thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •