Base | Representation |
---|---|
bin | 1111011011100101… |
… | …0111000111011111 |
3 | 101200200100012010011 |
4 | 3312321113013133 |
5 | 31440402411111 |
6 | 1523010224051 |
7 | 204435251140 |
oct | 36671270737 |
9 | 11620305104 |
10 | 4142232031 |
11 | 1836200263 |
12 | 977285027 |
13 | 510230992 |
14 | 2b41b9ac7 |
15 | 1939bd021 |
hex | f6e571df |
4142232031 has 8 divisors (see below), whose sum is σ = 4782784160. Its totient is φ = 3513881088.
The previous prime is 4142232007. The next prime is 4142232041. The reversal of 4142232031 is 1302322414.
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 4142232031 - 25 = 4142231999 is a prime.
It is a super-2 number, since 2×41422320312 = 34316172397284769922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4142231993 and 4142232011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4142232001) 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, 3049566 + ... + 3050923.
It is an arithmetic number, because the mean of its divisors is an integer number (597848020).
Almost surely, 24142232031 is an apocalyptic number.
4142232031 is a deficient number, since it is larger than the sum of its proper divisors (640552129).
4142232031 is an equidigital number, since it uses as much as digits as its factorization.
4142232031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6100593.
The product of its (nonzero) digits is 1152, while the sum is 22.
The square root of 4142232031 is about 64360.1742617280. The cubic root of 4142232031 is about 1605.9972879520.
Adding to 4142232031 its reverse (1302322414), we get a palindrome (5444554445).
The spelling of 4142232031 in words is "four billion, one hundred forty-two million, two hundred thirty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •