Base | Representation |
---|---|
bin | 10000011101101110000… |
… | …100010011011111110001 |
3 | 11000011101211000121222212 |
4 | 100131232010103133301 |
5 | 122014123243133131 |
6 | 2223434001541505 |
7 | 144512500666535 |
oct | 20355604233761 |
9 | 4004354017885 |
10 | 1131423021041 |
11 | 3a6919887875 |
12 | 16333b344895 |
13 | 82900c1c351 |
14 | 3ca928d7bc5 |
15 | 1e66e4baa2b |
hex | 1076e1137f1 |
1131423021041 has 4 divisors (see below), whose sum is σ = 1131684505152. Its totient is φ = 1131161536932.
The previous prime is 1131423021037. The next prime is 1131423021073. The reversal of 1131423021041 is 1401203241311.
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 1131423021041 - 22 = 1131423021037 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1131423020998 and 1131423021016.
It is not an unprimeable number, because it can be changed into a prime (1131423021011) 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, 130735565 + ... + 130744218.
It is an arithmetic number, because the mean of its divisors is an integer number (282921126288).
Almost surely, 21131423021041 is an apocalyptic number.
It is an amenable number.
1131423021041 is a deficient number, since it is larger than the sum of its proper divisors (261484111).
1131423021041 is an equidigital number, since it uses as much as digits as its factorization.
1131423021041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 261484110.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 1131423021041 its reverse (1401203241311), we get a palindrome (2532626262352).
The spelling of 1131423021041 in words is "one trillion, one hundred thirty-one billion, four hundred twenty-three million, twenty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •