Base | Representation |
---|---|
bin | 1011101101111000… |
… | …1101111001010111 |
3 | 22010012100210110111 |
4 | 2323132031321113 |
5 | 22420141320011 |
6 | 1240033503451 |
7 | 140641163032 |
oct | 27336157127 |
9 | 8105323414 |
10 | 3145260631 |
11 | 1374465957 |
12 | 739411b87 |
13 | 3b1814186 |
14 | 21ba1a019 |
15 | 1361d9121 |
hex | bb78de57 |
3145260631 has 4 divisors (see below), whose sum is σ = 3145374000. Its totient is φ = 3145147264.
The previous prime is 3145260617. The next prime is 3145260637. The reversal of 3145260631 is 1360625413.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 3145260631 - 223 = 3136872023 is a prime.
It is a super-2 number, since 2×31452606312 = 19785328873837036322, 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 = 3145260593 and 3145260602.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3145260637) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15990 + ... + 80908.
It is an arithmetic number, because the mean of its divisors is an integer number (786343500).
Almost surely, 23145260631 is an apocalyptic number.
3145260631 is a deficient number, since it is larger than the sum of its proper divisors (113369).
3145260631 is an equidigital number, since it uses as much as digits as its factorization.
3145260631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113368.
The product of its (nonzero) digits is 12960, while the sum is 31.
The square root of 3145260631 is about 56082.6232535533. The cubic root of 3145260631 is about 1465.1616623193.
The spelling of 3145260631 in words is "three billion, one hundred forty-five million, two hundred sixty thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •