Base | Representation |
---|---|
bin | 111010100001000100101… |
… | …101101111100101011101 |
3 | 112020102112021200211221101 |
4 | 322201010231233211131 |
5 | 1011341001002344013 |
6 | 12315155544433101 |
7 | 563345062665121 |
oct | 72410455574535 |
9 | 15212467624841 |
10 | 4021242231133 |
11 | 1310443451296 |
12 | 54b415a78791 |
13 | 232280962a7a |
14 | dc8b45c9581 |
15 | 6e905d048dd |
hex | 3a844b6f95d |
4021242231133 has 8 divisors (see below), whose sum is σ = 4094125995456. Its totient is φ = 3948809760000.
The previous prime is 4021242231113. The next prime is 4021242231143. The reversal of 4021242231133 is 3311322421204.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4021242231133 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 (4021242231113) 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, 112805316 + ... + 112840957.
It is an arithmetic number, because the mean of its divisors is an integer number (511765749432).
Almost surely, 24021242231133 is an apocalyptic number.
It is an amenable number.
4021242231133 is a deficient number, since it is larger than the sum of its proper divisors (72883764323).
4021242231133 is a wasteful number, since it uses less digits than its factorization.
4021242231133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 225646595.
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 4021242231133 its reverse (3311322421204), we get a palindrome (7332564652337).
The spelling of 4021242231133 in words is "four trillion, twenty-one billion, two hundred forty-two million, two hundred thirty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.986 sec. • engine limits •