Base | Representation |
---|---|
bin | 1011000001100010110001… |
… | …0101000110111000101001 |
3 | 1120220202210012001212122222 |
4 | 2300120230111012320221 |
5 | 3042043044202040131 |
6 | 41440213035323425 |
7 | 2360503120164314 |
oct | 260305425067051 |
9 | 46822705055588 |
10 | 12121141440041 |
11 | 39536023887a7 |
12 | 14391a98b0575 |
13 | 69c032206a5a |
14 | 2dc94876d97b |
15 | 1604731e587b |
hex | b062c546e29 |
12121141440041 has 8 divisors (see below), whose sum is σ = 12747739305984. Its totient is φ = 11502842883840.
The previous prime is 12121141440029. The next prime is 12121141440043. The reversal of 12121141440041 is 14004414112121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12121141440041 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12121141440043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2074824440 + ... + 2074830281.
It is an arithmetic number, because the mean of its divisors is an integer number (1593467413248).
Almost surely, 212121141440041 is an apocalyptic number.
It is an amenable number.
12121141440041 is a deficient number, since it is larger than the sum of its proper divisors (626597865943).
12121141440041 is a wasteful number, since it uses less digits than its factorization.
12121141440041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4149654871.
The product of its (nonzero) digits is 1024, while the sum is 26.
Adding to 12121141440041 its reverse (14004414112121), we get a palindrome (26125555552162).
The spelling of 12121141440041 in words is "twelve trillion, one hundred twenty-one billion, one hundred forty-one million, four hundred forty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •