Base | Representation |
---|---|
bin | 10001111010100011010… |
… | …001111001010101001101 |
3 | 11100200200110220000210102 |
4 | 101322203101321111031 |
5 | 130132243101233031 |
6 | 2341320510020445 |
7 | 154641543355241 |
oct | 21724321712515 |
9 | 4320613800712 |
10 | 1231100024141 |
11 | 435119961589 |
12 | 17a718aa7725 |
13 | 8c12783b760 |
14 | 4382aaba421 |
15 | 220551a27cb |
hex | 11ea347954d |
1231100024141 has 4 divisors (see below), whose sum is σ = 1325800026012. Its totient is φ = 1136400022272.
The previous prime is 1231100024123. The next prime is 1231100024171. The reversal of 1231100024141 is 1414200011321.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 633178275625 + 597921748516 = 795725^2 + 773254^2 .
It is a cyclic number.
It is not a de Polignac number, because 1231100024141 - 214 = 1231100007757 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1231100024171) 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, 47350000916 + ... + 47350000941.
It is an arithmetic number, because the mean of its divisors is an integer number (331450006503).
Almost surely, 21231100024141 is an apocalyptic number.
It is an amenable number.
1231100024141 is a deficient number, since it is larger than the sum of its proper divisors (94700001871).
1231100024141 is an equidigital number, since it uses as much as digits as its factorization.
1231100024141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94700001870.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 1231100024141 its reverse (1414200011321), we get a palindrome (2645300035462).
The spelling of 1231100024141 in words is "one trillion, two hundred thirty-one billion, one hundred million, twenty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •