Base | Representation |
---|---|
bin | 101100010000100001110… |
… | …001010001101000111101 |
3 | 101202202101122002110220222 |
4 | 230100201301101220331 |
5 | 344312243233123010 |
6 | 10245111302151125 |
7 | 432506545305131 |
oct | 54204161215075 |
9 | 11682348073828 |
10 | 3041403411005 |
11 | a72940a33223 |
12 | 41153ba224a5 |
13 | 190a5958667b |
14 | a72c1a233c1 |
15 | 541a9546355 |
hex | 2c421c51a3d |
3041403411005 has 8 divisors (see below), whose sum is σ = 3649803148032. Its totient is φ = 2433043358928.
The previous prime is 3041403411001. The next prime is 3041403411019. The reversal of 3041403411005 is 5001143041403.
It is a happy number.
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 3041403411005 - 22 = 3041403411001 is a prime.
It is a super-2 number, since 2×30414034110052 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3041403411001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9752369 + ... + 10059398.
It is an arithmetic number, because the mean of its divisors is an integer number (456225393504).
Almost surely, 23041403411005 is an apocalyptic number.
It is an amenable number.
3041403411005 is a deficient number, since it is larger than the sum of its proper divisors (608399737027).
3041403411005 is a wasteful number, since it uses less digits than its factorization.
3041403411005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19842475.
The product of its (nonzero) digits is 2880, while the sum is 26.
Adding to 3041403411005 its reverse (5001143041403), we get a palindrome (8042546452408).
The spelling of 3041403411005 in words is "three trillion, forty-one billion, four hundred three million, four hundred eleven thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •