Base | Representation |
---|---|
bin | 111100001001001011001… |
… | …100111110011000111101 |
3 | 112122010001021201120220212 |
4 | 330021023030332120331 |
5 | 1020203411134344404 |
6 | 12442403331122205 |
7 | 604413044214251 |
oct | 74111314763075 |
9 | 15563037646825 |
10 | 4133020231229 |
11 | 135389319a16a |
12 | 569010143365 |
13 | 23c985619226 |
14 | 10407999a261 |
15 | 7279905c06e |
hex | 3c24b33e63d |
4133020231229 has 8 divisors (see below), whose sum is σ = 4350653963040. Its totient is φ = 3915397134576.
The previous prime is 4133020231217. The next prime is 4133020231271. The reversal of 4133020231229 is 9221320203314.
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 4133020231229 - 216 = 4133020165693 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4133020231195 and 4133020231204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4133020231279) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1854854 + ... + 3421479.
It is an arithmetic number, because the mean of its divisors is an integer number (543831745380).
Almost surely, 24133020231229 is an apocalyptic number.
It is an amenable number.
4133020231229 is a deficient number, since it is larger than the sum of its proper divisors (217633731811).
4133020231229 is a wasteful number, since it uses less digits than its factorization.
4133020231229 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5317579.
The product of its (nonzero) digits is 15552, while the sum is 32.
The spelling of 4133020231229 in words is "four trillion, one hundred thirty-three billion, twenty million, two hundred thirty-one thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •