Base | Representation |
---|---|
bin | 101100010000100001101… |
… | …000001001111110110101 |
3 | 101202202101110121000112212 |
4 | 230100201220021332311 |
5 | 344312242130122331 |
6 | 10245111135023205 |
7 | 432506516060225 |
oct | 54204150117665 |
9 | 11682343530485 |
10 | 3041401020341 |
11 | a7293a650072 |
12 | 41153b06ab05 |
13 | 190a58c2a488 |
14 | a72c15a0085 |
15 | 541a9222d2b |
hex | 2c421a09fb5 |
3041401020341 has 8 divisors (see below), whose sum is σ = 3295197823104. Its totient is φ = 2795925424320.
The previous prime is 3041401020311. The next prime is 3041401020407. The reversal of 3041401020341 is 1430201041403.
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 3041401020341 - 238 = 2766523113397 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3041401020311) 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, 2080300925 + ... + 2080302386.
It is an arithmetic number, because the mean of its divisors is an integer number (411899727888).
Almost surely, 23041401020341 is an apocalyptic number.
It is an amenable number.
3041401020341 is a deficient number, since it is larger than the sum of its proper divisors (253796802763).
3041401020341 is a wasteful number, since it uses less digits than its factorization.
3041401020341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4160603371.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 3041401020341 its reverse (1430201041403), we get a palindrome (4471602061744).
The spelling of 3041401020341 in words is "three trillion, forty-one billion, four hundred one million, twenty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •