Base | Representation |
---|---|
bin | 1011101101010000… |
… | …0100010111000011 |
3 | 22010000100121221110 |
4 | 2323110010113003 |
5 | 22414001201011 |
6 | 1235500454403 |
7 | 140606442336 |
oct | 27324042703 |
9 | 8100317843 |
10 | 3142600131 |
11 | 1372a08aa0 |
12 | 73854a403 |
13 | 3b10c2208 |
14 | 21b52661d |
15 | 135d60ba6 |
hex | bb5045c3 |
3142600131 has 16 divisors (see below), whose sum is σ = 4648533120. Its totient is φ = 1872323520.
The previous prime is 3142600099. The next prime is 3142600163. The reversal of 3142600131 is 1310062413.
It is an interprime number because it is at equal distance from previous prime (3142600099) and next prime (3142600163).
It is not a de Polignac number, because 3142600131 - 25 = 3142600099 is a prime.
It is a super-2 number, since 2×31426001312 = 19751871166722434322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3142600098 and 3142600107.
It is not an unprimeable number, because it can be changed into a prime (3142610131) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 805090 + ... + 808983.
It is an arithmetic number, because the mean of its divisors is an integer number (290533320).
Almost surely, 23142600131 is an apocalyptic number.
3142600131 is a deficient number, since it is larger than the sum of its proper divisors (1505932989).
3142600131 is a wasteful number, since it uses less digits than its factorization.
3142600131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1614146.
The product of its (nonzero) digits is 432, while the sum is 21.
The square root of 3142600131 is about 56058.8987672787. The cubic root of 3142600131 is about 1464.7484308292.
Adding to 3142600131 its reverse (1310062413), we get a palindrome (4452662544).
The spelling of 3142600131 in words is "three billion, one hundred forty-two million, six hundred thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •