Base | Representation |
---|---|
bin | 101100010000001011110… |
… | …100011011110000011001 |
3 | 101202201102222010101020121 |
4 | 230100023310123300121 |
5 | 344311014443440441 |
6 | 10245010544553241 |
7 | 432464454123106 |
oct | 54201364336031 |
9 | 11681388111217 |
10 | 3041035140121 |
11 | a72772069920 |
12 | 411458622821 |
13 | 1909cb1a40c4 |
14 | a7288b5baad |
15 | 5418704ddd1 |
hex | 2c40bd1bc19 |
3041035140121 has 8 divisors (see below), whose sum is σ = 3492097768800. Its totient is φ = 2619073326240.
The previous prime is 3041035140047. The next prime is 3041035140167. The reversal of 3041035140121 is 1210415301403.
3041035140121 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 3041035140121 - 213 = 3041035131929 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3041035140721) 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 7 ways as a sum of consecutive naturals, for example, 7275203476 + ... + 7275203893.
It is an arithmetic number, because the mean of its divisors is an integer number (436512221100).
Almost surely, 23041035140121 is an apocalyptic number.
It is an amenable number.
3041035140121 is a deficient number, since it is larger than the sum of its proper divisors (451062628679).
3041035140121 is a wasteful number, since it uses less digits than its factorization.
3041035140121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14550407399.
The product of its (nonzero) digits is 1440, while the sum is 25.
The spelling of 3041035140121 in words is "three trillion, forty-one billion, thirty-five million, one hundred forty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •