Base | Representation |
---|---|
bin | 1111011011110011… |
… | …0000101010111011 |
3 | 101200202000110110212 |
4 | 3312330300222323 |
5 | 31441114420011 |
6 | 1523041301335 |
7 | 204445652120 |
oct | 36674605273 |
9 | 11622013425 |
10 | 4143123131 |
11 | 1836759804 |
12 | 97763484b |
13 | 510483464 |
14 | 2b436c747 |
15 | 193ae708b |
hex | f6f30abb |
4143123131 has 4 divisors (see below), whose sum is σ = 4734997872. Its totient is φ = 3551248392.
The previous prime is 4143123119. The next prime is 4143123161. The reversal of 4143123131 is 1313213414.
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 4143123131 - 210 = 4143122107 is a prime.
It is a super-2 number, since 2×41431231312 = 34330938557254486322, 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 = 4143123097 and 4143123106.
It is not an unprimeable number, because it can be changed into a prime (4143123161) 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, 295937360 + ... + 295937373.
It is an arithmetic number, because the mean of its divisors is an integer number (1183749468).
Almost surely, 24143123131 is an apocalyptic number.
4143123131 is a deficient number, since it is larger than the sum of its proper divisors (591874741).
4143123131 is an equidigital number, since it uses as much as digits as its factorization.
4143123131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 591874740.
The product of its digits is 864, while the sum is 23.
The square root of 4143123131 is about 64367.0966488314. The cubic root of 4143123131 is about 1606.1124433853.
Adding to 4143123131 its reverse (1313213414), we get a palindrome (5456336545).
The spelling of 4143123131 in words is "four billion, one hundred forty-three million, one hundred twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •