Base | Representation |
---|---|
bin | 111011000000101001010… |
… | …000000110001101101010 |
3 | 112100200000202121112222120 |
4 | 323000221100012031222 |
5 | 1012414412122304114 |
6 | 12342523421332110 |
7 | 565655115405132 |
oct | 73005120061552 |
9 | 15320022545876 |
10 | 4055141213034 |
11 | 132385955210a |
12 | 555ab6707036 |
13 | 235523a3a542 |
14 | 1003ac7adac2 |
15 | 7073bd9c5a9 |
hex | 3b02940636a |
4055141213034 has 8 divisors (see below), whose sum is σ = 8110282426080. Its totient is φ = 1351713737676.
The previous prime is 4055141212961. The next prime is 4055141213051. The reversal of 4055141213034 is 4303121415504.
It is a sphenic number, since it is the product of 3 distinct primes.
4055141213034 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 4055141212986 and 4055141213004.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 337928434414 + ... + 337928434425.
It is an arithmetic number, because the mean of its divisors is an integer number (1013785303260).
Almost surely, 24055141213034 is an apocalyptic number.
4055141213034 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4055141213034 is a wasteful number, since it uses less digits than its factorization.
4055141213034 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 675856868844.
The product of its (nonzero) digits is 28800, while the sum is 33.
Adding to 4055141213034 its reverse (4303121415504), we get a palindrome (8358262628538).
The spelling of 4055141213034 in words is "four trillion, fifty-five billion, one hundred forty-one million, two hundred thirteen thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •