Base | Representation |
---|---|
bin | 111100010000101000010… |
… | …010100110111011000001 |
3 | 112122212201010001112011121 |
4 | 330100220102212323001 |
5 | 1020321304224040001 |
6 | 12450205501112241 |
7 | 605115305654011 |
oct | 74205022467301 |
9 | 15585633045147 |
10 | 4141024440001 |
11 | 1357220381739 |
12 | 56a684858681 |
13 | 24065c9a3c37 |
14 | 1045d8a3bc41 |
15 | 72ab6ad96a1 |
hex | 3c4284a6ec1 |
4141024440001 has 4 divisors (see below), whose sum is σ = 4141031317504. Its totient is φ = 4141017562500.
The previous prime is 4141024439971. The next prime is 4141024440053. The reversal of 4141024440001 is 1000444201414.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 4141024440001 - 25 = 4141024439969 is a prime.
It is a super-3 number, since 3×41410244400013 (a number of 39 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4141024443001) 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, 2438625 + ... + 3772126.
It is an arithmetic number, because the mean of its divisors is an integer number (1035257829376).
Almost surely, 24141024440001 is an apocalyptic number.
It is an amenable number.
4141024440001 is a deficient number, since it is larger than the sum of its proper divisors (6877503).
4141024440001 is an equidigital number, since it uses as much as digits as its factorization.
4141024440001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6877502.
The product of its (nonzero) digits is 2048, while the sum is 25.
Adding to 4141024440001 its reverse (1000444201414), we get a palindrome (5141468641415).
The spelling of 4141024440001 in words is "four trillion, one hundred forty-one billion, twenty-four million, four hundred forty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •