Base | Representation |
---|---|
bin | 111010100011101111101… |
… | …010111111100100111111 |
3 | 112020200221011200122100202 |
4 | 322203233222333210333 |
5 | 1011412334231223033 |
6 | 12320352323514115 |
7 | 563506131101531 |
oct | 72435752774477 |
9 | 15220834618322 |
10 | 4024110414143 |
11 | 1311685469676 |
12 | 54ba9652893b |
13 | 232619c43791 |
14 | dcaa74bb851 |
15 | 6ea22a0b8e8 |
hex | 3a8efabf93f |
4024110414143 has 8 divisors (see below), whose sum is σ = 4025223473760. Its totient is φ = 4022997511680.
The previous prime is 4024110414139. The next prime is 4024110414167. The reversal of 4024110414143 is 3414140114204.
It is a happy number.
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 4024110414143 - 22 = 4024110414139 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4024110414113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 65339198 + ... + 65400756.
It is an arithmetic number, because the mean of its divisors is an integer number (503152934220).
Almost surely, 24024110414143 is an apocalyptic number.
4024110414143 is a deficient number, since it is larger than the sum of its proper divisors (1113059617).
4024110414143 is a wasteful number, since it uses less digits than its factorization.
4024110414143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78577.
The product of its (nonzero) digits is 6144, while the sum is 29.
Adding to 4024110414143 its reverse (3414140114204), we get a palindrome (7438250528347).
The spelling of 4024110414143 in words is "four trillion, twenty-four billion, one hundred ten million, four hundred fourteen thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •