Base | Representation |
---|---|
bin | 1110111100100010… |
… | …1100010001110101 |
3 | 101100121100101211001 |
4 | 3233020230101311 |
5 | 31204040030031 |
6 | 1502035443301 |
7 | 201264501424 |
oct | 35710542165 |
9 | 11317311731 |
10 | 4012033141 |
11 | 1779762976 |
12 | 93b756531 |
13 | 4bc27580c |
14 | 2a0ba72bb |
15 | 187350861 |
hex | ef22c475 |
4012033141 has 8 divisors (see below), whose sum is σ = 4224348800. Its totient is φ = 3799833120.
The previous prime is 4012033121. The next prime is 4012033213. The reversal of 4012033141 is 1413302104.
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 4012033141 - 213 = 4012024949 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4012033111) 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 7 ways as a sum of consecutive naturals, for example, 47521 + ... + 101401.
It is an arithmetic number, because the mean of its divisors is an integer number (528043600).
Almost surely, 24012033141 is an apocalyptic number.
It is an amenable number.
4012033141 is a deficient number, since it is larger than the sum of its proper divisors (212315659).
4012033141 is a wasteful number, since it uses less digits than its factorization.
4012033141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57819.
The product of its (nonzero) digits is 288, while the sum is 19.
The square root of 4012033141 is about 63340.6120984002. The cubic root of 4012033141 is about 1588.9912435062.
Adding to 4012033141 its reverse (1413302104), we get a palindrome (5425335245).
The spelling of 4012033141 in words is "four billion, twelve million, thirty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •