Base | Representation |
---|---|
bin | 1111011011100011… |
… | …1110010000110111 |
3 | 101200200011000110210 |
4 | 3312320332100313 |
5 | 31440341131411 |
6 | 1523004120503 |
7 | 204434345301 |
oct | 36670762067 |
9 | 11620130423 |
10 | 4142130231 |
11 | 1836140828 |
12 | 977236133 |
13 | 5101c6545 |
14 | 2b4190971 |
15 | 19399cca6 |
hex | f6e3e437 |
4142130231 has 4 divisors (see below), whose sum is σ = 5522840312. Its totient is φ = 2761420152.
The previous prime is 4142130227. The next prime is 4142130263. The reversal of 4142130231 is 1320312414.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 4142130231 - 22 = 4142130227 is a prime.
It is a super-2 number, since 2×41421302312 = 34314485701128226722, 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 = 4142130198 and 4142130207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4142130281) 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, 690355036 + ... + 690355041.
It is an arithmetic number, because the mean of its divisors is an integer number (1380710078).
Almost surely, 24142130231 is an apocalyptic number.
4142130231 is a deficient number, since it is larger than the sum of its proper divisors (1380710081).
4142130231 is a wasteful number, since it uses less digits than its factorization.
4142130231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1380710080.
The product of its (nonzero) digits is 576, while the sum is 21.
The square root of 4142130231 is about 64359.3833951196. The cubic root of 4142130231 is about 1605.9841314491.
Adding to 4142130231 its reverse (1320312414), we get a palindrome (5462442645).
The spelling of 4142130231 in words is "four billion, one hundred forty-two million, one hundred thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •