Base | Representation |
---|---|
bin | 111010100001010000100… |
… | …101001011000110100111 |
3 | 112020110001011022011101002 |
4 | 322201100211023012213 |
5 | 1011341402433424033 |
6 | 12315231415423515 |
7 | 563353031101244 |
oct | 72412045130647 |
9 | 15213034264332 |
10 | 4021441311143 |
11 | 1310535866023 |
12 | 54b470684b9b |
13 | 2322b2c873a9 |
14 | dc8d2c0c5cb |
15 | 6e91852b3e8 |
hex | 3a85094b1a7 |
4021441311143 has 4 divisors (see below), whose sum is σ = 4028793123960. Its totient is φ = 4014089498328.
The previous prime is 4021441311133. The next prime is 4021441311161. The reversal of 4021441311143 is 3411131441204.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4021441311143 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 (4021441311103) 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 3 ways as a sum of consecutive naturals, for example, 3675905588 + ... + 3675906681.
It is an arithmetic number, because the mean of its divisors is an integer number (1007198280990).
Almost surely, 24021441311143 is an apocalyptic number.
4021441311143 is a deficient number, since it is larger than the sum of its proper divisors (7351812817).
4021441311143 is an equidigital number, since it uses as much as digits as its factorization.
4021441311143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7351812816.
The product of its (nonzero) digits is 4608, while the sum is 29.
Adding to 4021441311143 its reverse (3411131441204), we get a palindrome (7432572752347).
The spelling of 4021441311143 in words is "four trillion, twenty-one billion, four hundred forty-one million, three hundred eleven thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •