Base | Representation |
---|---|
bin | 111101101110001110111… |
… | …010111110000000000111 |
3 | 120000111010120000121202212 |
4 | 331232032322332000013 |
5 | 1023443123304403020 |
6 | 13004310543454035 |
7 | 615304036521533 |
oct | 75561672760007 |
9 | 16014116017685 |
10 | 4241530544135 |
11 | 1395906463315 |
12 | 586053bb731b |
13 | 249c892c4c81 |
14 | 109410da2bc3 |
15 | 754ea495cc5 |
hex | 3db8eebe007 |
4241530544135 has 4 divisors (see below), whose sum is σ = 5089836652968. Its totient is φ = 3393224435304.
The previous prime is 4241530544099. The next prime is 4241530544137. The reversal of 4241530544135 is 5314450351424.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 4241530544135 - 26 = 4241530544071 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4241530544092 and 4241530544101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4241530544137) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 424153054409 + ... + 424153054418.
It is an arithmetic number, because the mean of its divisors is an integer number (1272459163242).
Almost surely, 24241530544135 is an apocalyptic number.
4241530544135 is a deficient number, since it is larger than the sum of its proper divisors (848306108833).
4241530544135 is an equidigital number, since it uses as much as digits as its factorization.
4241530544135 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 848306108832.
The product of its (nonzero) digits is 576000, while the sum is 41.
Adding to 4241530544135 its reverse (5314450351424), we get a palindrome (9555980895559).
The spelling of 4241530544135 in words is "four trillion, two hundred forty-one billion, five hundred thirty million, five hundred forty-four thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •