Base | Representation |
---|---|
bin | 1011101100111111… |
… | …1111000110010101 |
3 | 22002221100021000011 |
4 | 2323033333012111 |
5 | 22413212430010 |
6 | 1235421520221 |
7 | 140564364415 |
oct | 27317770625 |
9 | 8087307004 |
10 | 3141530005 |
11 | 1372347a99 |
12 | 738113071 |
13 | 3b0b090c3 |
14 | 21b328645 |
15 | 135beda8a |
hex | bb3ff195 |
3141530005 has 4 divisors (see below), whose sum is σ = 3769836012. Its totient is φ = 2513224000.
The previous prime is 3141529999. The next prime is 3141530023. The reversal of 3141530005 is 5000351413.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 5000351413 = 479 ⋅10439147.
It can be written as a sum of positive squares in 2 ways, for example, as 653415844 + 2488114161 = 25562^2 + 49881^2 .
It is not a de Polignac number, because 3141530005 - 27 = 3141529877 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 314152996 + ... + 314153005.
It is an arithmetic number, because the mean of its divisors is an integer number (942459003).
Almost surely, 23141530005 is an apocalyptic number.
It is an amenable number.
3141530005 is a deficient number, since it is larger than the sum of its proper divisors (628306007).
3141530005 is an equidigital number, since it uses as much as digits as its factorization.
3141530005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 628306006.
The product of its (nonzero) digits is 900, while the sum is 22.
The square root of 3141530005 is about 56049.3532968936. The cubic root of 3141530005 is about 1464.5821520296.
Adding to 3141530005 its reverse (5000351413), we get a palindrome (8141881418).
The spelling of 3141530005 in words is "three billion, one hundred forty-one million, five hundred thirty thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •