Base | Representation |
---|---|
bin | 111010001110011101110… |
… | …000010100001000110101 |
3 | 112011111221202221101011112 |
4 | 322032131300110020311 |
5 | 1011024040334202020 |
6 | 12302053134444405 |
7 | 562036661244206 |
oct | 72163560241065 |
9 | 15144852841145 |
10 | 4001261240885 |
11 | 1302a1a726607 |
12 | 54757a363705 |
13 | 2304181b290c |
14 | db93aa515ad |
15 | 6e136a912c5 |
hex | 3a39dc14235 |
4001261240885 has 8 divisors (see below), whose sum is σ = 4809610479960. Its totient is φ = 3195610998784.
The previous prime is 4001261240881. The next prime is 4001261240887. The reversal of 4001261240885 is 5880421621004.
It can be written as a sum of positive squares in 4 ways, for example, as 1289240836 + 3999972000049 = 35906^2 + 1999993^2 .
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 4001261240885 - 22 = 4001261240881 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4001261240881) 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, 674745980 + ... + 674751909.
It is an arithmetic number, because the mean of its divisors is an integer number (601201309995).
Almost surely, 24001261240885 is an apocalyptic number.
It is an amenable number.
4001261240885 is a deficient number, since it is larger than the sum of its proper divisors (808349239075).
4001261240885 is a wasteful number, since it uses less digits than its factorization.
4001261240885 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1349498487.
The product of its (nonzero) digits is 122880, while the sum is 41.
Adding to 4001261240885 its reverse (5880421621004), we get a palindrome (9881682861889).
The spelling of 4001261240885 in words is "four trillion, one billion, two hundred sixty-one million, two hundred forty thousand, eight hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •