Base | Representation |
---|---|
bin | 1011101101001100… |
… | …0001001111010101 |
3 | 22002222211122211000 |
4 | 2323103001033111 |
5 | 22413413401310 |
6 | 1235450533513 |
7 | 140604215655 |
oct | 27323011725 |
9 | 8088748730 |
10 | 3142325205 |
11 | 1372840488 |
12 | 738437299 |
13 | 3b1027036 |
14 | 21b494365 |
15 | 135d094c0 |
hex | bb4c13d5 |
3142325205 has 64 divisors (see below), whose sum is σ = 5847552000. Its totient is φ = 1598008896.
The previous prime is 3142325161. The next prime is 3142325213. The reversal of 3142325205 is 5025232413.
It is a happy number.
3142325205 is a `hidden beast` number, since 31 + 423 + 2 + 5 + 205 = 666.
It is not a de Polignac number, because 3142325205 - 26 = 3142325141 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a zygodrome in base 3.
It is a congruent number.
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 63 ways as a sum of consecutive naturals, for example, 1113286 + ... + 1116104.
It is an arithmetic number, because the mean of its divisors is an integer number (91368000).
Almost surely, 23142325205 is an apocalyptic number.
It is an amenable number.
3142325205 is a deficient number, since it is larger than the sum of its proper divisors (2705226795).
3142325205 is a wasteful number, since it uses less digits than its factorization.
3142325205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3215 (or 3209 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 27.
The square root of 3142325205 is about 56056.4465962658. The cubic root of 3142325205 is about 1464.7057157574.
Adding to 3142325205 its reverse (5025232413), we get a palindrome (8167557618).
The spelling of 3142325205 in words is "three billion, one hundred forty-two million, three hundred twenty-five thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •