Base | Representation |
---|---|
bin | 1011101100111001… |
… | …0110101011111011 |
3 | 22002220112112100101 |
4 | 2323032112223323 |
5 | 22413110233311 |
6 | 1235404420231 |
7 | 140560633513 |
oct | 27316265373 |
9 | 8086475311 |
10 | 3141102331 |
11 | 1372085744 |
12 | 737b47677 |
13 | 3b09b9543 |
14 | 21b256843 |
15 | 135b66ec1 |
hex | bb396afb |
3141102331 has 8 divisors (see below), whose sum is σ = 3187800000. Its totient is φ = 3094578240.
The previous prime is 3141102329. The next prime is 3141102337. The reversal of 3141102331 is 1332011413.
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 3141102331 - 21 = 3141102329 is a prime.
It is a super-2 number, since 2×31411023312 = 19733047707627267122, 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 = 3141102299 and 3141102308.
It is not an unprimeable number, because it can be changed into a prime (3141102337) 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, 6706 + ... + 79543.
It is an arithmetic number, because the mean of its divisors is an integer number (398475000).
Almost surely, 23141102331 is an apocalyptic number.
3141102331 is a deficient number, since it is larger than the sum of its proper divisors (46697669).
3141102331 is an equidigital number, since it uses as much as digits as its factorization.
3141102331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86789.
The product of its (nonzero) digits is 216, while the sum is 19.
The square root of 3141102331 is about 56045.5380115135. The cubic root of 3141102331 is about 1464.5156884347.
Adding to 3141102331 its reverse (1332011413), we get a palindrome (4473113744).
The spelling of 3141102331 in words is "three billion, one hundred forty-one million, one hundred two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •