Base | Representation |
---|---|
bin | 111111000011100011010… |
… | …101001101000111000001 |
3 | 120100020121001022000222222 |
4 | 333003203111031013001 |
5 | 1031443233100133441 |
6 | 13114341214140425 |
7 | 625026162652343 |
oct | 77034325150701 |
9 | 16306531260888 |
10 | 4333141021121 |
11 | 1420747161620 |
12 | 59b9601b1715 |
13 | 2557c897a9c3 |
14 | 10da21b21293 |
15 | 77aacde0d4b |
hex | 3f0e354d1c1 |
4333141021121 has 16 divisors (see below), whose sum is σ = 4816417541760. Its totient is φ = 3864762021120.
The previous prime is 4333141021109. The next prime is 4333141021163. The reversal of 4333141021121 is 1211201413334.
4333141021121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-4333141021121 is a prime.
It is a super-2 number, since 2×43331410211212 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (4333141021921) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19538585 + ... + 19759113.
It is an arithmetic number, because the mean of its divisors is an integer number (301026096360).
Almost surely, 24333141021121 is an apocalyptic number.
It is an amenable number.
4333141021121 is a deficient number, since it is larger than the sum of its proper divisors (483276520639).
4333141021121 is a wasteful number, since it uses less digits than its factorization.
4333141021121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 254296.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 4333141021121 its reverse (1211201413334), we get a palindrome (5544342434455).
The spelling of 4333141021121 in words is "four trillion, three hundred thirty-three billion, one hundred forty-one million, twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •