Base | Representation |
---|---|
bin | 111101101110000011111… |
… | …011000110101111001101 |
3 | 120000110122200211100201001 |
4 | 331232003323012233031 |
5 | 1023442234040434131 |
6 | 13004240353020301 |
7 | 615266336264164 |
oct | 75560373065715 |
9 | 16013580740631 |
10 | 4241346030541 |
11 | 1395821298544 |
12 | 586002254691 |
13 | 249c5a000829 |
14 | 1093d46923db |
15 | 754d919a261 |
hex | 3db83ec6bcd |
4241346030541 has 8 divisors (see below), whose sum is σ = 4490855141184. Its totient is φ = 3991838938560.
The previous prime is 4241346030527. The next prime is 4241346030547. The reversal of 4241346030541 is 1450306431424.
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 4241346030541 - 219 = 4241345506253 is a prime.
It is a super-4 number, since 4×42413460305414 (a number of 52 digits) contains 4444 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 4241346030541.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4241346030547) 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, 7066386 + ... + 7643068.
It is an arithmetic number, because the mean of its divisors is an integer number (561356892648).
Almost surely, 24241346030541 is an apocalyptic number.
It is an amenable number.
4241346030541 is a deficient number, since it is larger than the sum of its proper divisors (249509110643).
4241346030541 is a wasteful number, since it uses less digits than its factorization.
4241346030541 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1009331.
The product of its (nonzero) digits is 138240, while the sum is 37.
The spelling of 4241346030541 in words is "four trillion, two hundred forty-one billion, three hundred forty-six million, thirty thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •