Base | Representation |
---|---|
bin | 1011101101000001… |
… | …0001111101001011 |
3 | 22002221111011221211 |
4 | 2323100101331023 |
5 | 22413222412433 |
6 | 1235423313551 |
7 | 140565135535 |
oct | 27320217513 |
9 | 8087434854 |
10 | 3141607243 |
11 | 13723a0025 |
12 | 73814b8b7 |
13 | 3b0b352c8 |
14 | 21b348855 |
15 | 135c168cd |
hex | bb411f4b |
3141607243 has 4 divisors (see below), whose sum is σ = 3142160208. Its totient is φ = 3141054280.
The previous prime is 3141607201. The next prime is 3141607267. The reversal of 3141607243 is 3427061413.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 3141607243 - 221 = 3139510091 is a prime.
It is a super-2 number, since 2×31416072432 = 19739392138540122098, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3141607643) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 267871 + ... + 279352.
It is an arithmetic number, because the mean of its divisors is an integer number (785540052).
Almost surely, 23141607243 is an apocalyptic number.
3141607243 is a deficient number, since it is larger than the sum of its proper divisors (552965).
3141607243 is an equidigital number, since it uses as much as digits as its factorization.
3141607243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 552964.
The product of its (nonzero) digits is 12096, while the sum is 31.
The square root of 3141607243 is about 56050.0423104211. The cubic root of 3141607243 is about 1464.5941547236.
Adding to 3141607243 its reverse (3427061413), we get a palindrome (6568668656).
The spelling of 3141607243 in words is "three billion, one hundred forty-one million, six hundred seven thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •