Base | Representation |
---|---|
bin | 1011101000101001… |
… | …0000101110100011 |
3 | 22001122221122110212 |
4 | 2322022100232203 |
5 | 22344023032011 |
6 | 1233530044335 |
7 | 140253130226 |
oct | 27212205643 |
9 | 8048848425 |
10 | 3123252131 |
11 | 1362aa360a |
12 | 731b796ab |
13 | 3aa0a97ac |
14 | 218b2b5bd |
15 | 1342dd08b |
hex | ba290ba3 |
3123252131 has 8 divisors (see below), whose sum is σ = 3195111744. Its totient is φ = 3051617920.
The previous prime is 3123252127. The next prime is 3123252151. The reversal of 3123252131 is 1312523213.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3123252131 - 22 = 3123252127 is a prime.
It is a super-2 number, since 2×31232521312 = 19509407747592082322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3123252097 and 3123252106.
It is not an unprimeable number, because it can be changed into a prime (3123252151) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 28160 + ... + 83901.
It is an arithmetic number, because the mean of its divisors is an integer number (399388968).
Almost surely, 23123252131 is an apocalyptic number.
3123252131 is a deficient number, since it is larger than the sum of its proper divisors (71859613).
3123252131 is a wasteful number, since it uses less digits than its factorization.
3123252131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112701.
The product of its digits is 1080, while the sum is 23.
The square root of 3123252131 is about 55886.0638352711. The cubic root of 3123252131 is about 1461.7362422739.
Adding to 3123252131 its reverse (1312523213), we get a palindrome (4435775344).
The spelling of 3123252131 in words is "three billion, one hundred twenty-three million, two hundred fifty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •