Base | Representation |
---|---|
bin | 111010100011101001110… |
… | …000010001000100101101 |
3 | 112020200200020212122112212 |
4 | 322203221300101010231 |
5 | 1011412133322230404 |
6 | 12320334415540205 |
7 | 563503514163023 |
oct | 72435160210455 |
9 | 15220606778485 |
10 | 4024011133229 |
11 | 131163441942a |
12 | 54ba6922a665 |
13 | 2326024c2389 |
14 | dca98236713 |
15 | 6ea18e4a06e |
hex | 3a8e9c1112d |
4024011133229 has 8 divisors (see below), whose sum is σ = 4025934104640. Its totient is φ = 4022088418656.
The previous prime is 4024011133201. The next prime is 4024011133231. The reversal of 4024011133229 is 9223311104204.
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 4024011133229 - 236 = 3955291656493 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4024011133195 and 4024011133204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4024011133249) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36035009 + ... + 36146505.
It is an arithmetic number, because the mean of its divisors is an integer number (503241763080).
Almost surely, 24024011133229 is an apocalyptic number.
It is an amenable number.
4024011133229 is a deficient number, since it is larger than the sum of its proper divisors (1922971411).
4024011133229 is a wasteful number, since it uses less digits than its factorization.
4024011133229 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128419.
The product of its (nonzero) digits is 10368, while the sum is 32.
The spelling of 4024011133229 in words is "four trillion, twenty-four billion, eleven million, one hundred thirty-three thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •