Base | Representation |
---|---|
bin | 10000001100101011101… |
… | …110100000001010110101 |
3 | 10221102011221202000011212 |
4 | 100030223232200022311 |
5 | 121214142303442331 |
6 | 2211210454011205 |
7 | 143264255036042 |
oct | 20145356401265 |
9 | 3842157660155 |
10 | 1113130140341 |
11 | 39a091a4384a |
12 | 15b895046b05 |
13 | 80c7711459b |
14 | 3bc3922c1c9 |
15 | 1de4d55cd2b |
hex | 1032bba02b5 |
1113130140341 has 4 divisors (see below), whose sum is σ = 1115128579212. Its totient is φ = 1111131701472.
The previous prime is 1113130140293. The next prime is 1113130140443. The reversal of 1113130140341 is 1430410313111.
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 303722232100 + 809407908241 = 551110^2 + 899671^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1113130140341 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 (1113130140041) 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, 999218600 + ... + 999219713.
It is an arithmetic number, because the mean of its divisors is an integer number (278782144803).
Almost surely, 21113130140341 is an apocalyptic number.
It is an amenable number.
1113130140341 is a deficient number, since it is larger than the sum of its proper divisors (1998438871).
1113130140341 is an equidigital number, since it uses as much as digits as its factorization.
1113130140341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1998438870.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 1113130140341 its reverse (1430410313111), we get a palindrome (2543540453452).
The spelling of 1113130140341 in words is "one trillion, one hundred thirteen billion, one hundred thirty million, one hundred forty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •