Base | Representation |
---|---|
bin | 1011101101011110… |
… | …0001010010000001 |
3 | 22010002001121020001 |
4 | 2323113201102001 |
5 | 22414214130100 |
6 | 1235532120001 |
7 | 140620231453 |
oct | 27327412201 |
9 | 8102047201 |
10 | 3143505025 |
11 | 1373476941 |
12 | 738906001 |
13 | 3b134b05b |
14 | 21b6c02d3 |
15 | 135e8dd6a |
hex | bb5e1481 |
3143505025 has 24 divisors (see below), whose sum is σ = 4058188920. Its totient is φ = 2412533760.
The previous prime is 3143505019. The next prime is 3143505031. The reversal of 3143505025 is 5205053413.
It is an interprime number because it is at equal distance from previous prime (3143505019) and next prime (3143505031).
It can be written as a sum of positive squares in 12 ways, for example, as 2251407601 + 892097424 = 47449^2 + 29868^2 .
It is not a de Polignac number, because 3143505025 - 23 = 3143505017 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3143504984 and 3143505002.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 100017 + ... + 127633.
It is an arithmetic number, because the mean of its divisors is an integer number (169091205).
Almost surely, 23143505025 is an apocalyptic number.
It is an amenable number.
3143505025 is a deficient number, since it is larger than the sum of its proper divisors (914683895).
3143505025 is a wasteful number, since it uses less digits than its factorization.
3143505025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27813 (or 27808 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 28.
The square root of 3143505025 is about 56066.9691083797. The cubic root of 3143505025 is about 1464.8890060232.
Adding to 3143505025 its reverse (5205053413), we get a palindrome (8348558438).
The spelling of 3143505025 in words is "three billion, one hundred forty-three million, five hundred five thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •