Base | Representation |
---|---|
bin | 10000001100101011101… |
… | …110100000001011110001 |
3 | 10221102011221202000021002 |
4 | 100030223232200023301 |
5 | 121214142303443101 |
6 | 2211210454011345 |
7 | 143264255036156 |
oct | 20145356401361 |
9 | 3842157660232 |
10 | 1113130140401 |
11 | 39a091a438a4 |
12 | 15b895046b55 |
13 | 80c77114616 |
14 | 3bc3922c22d |
15 | 1de4d55cd6b |
hex | 1032bba02f1 |
1113130140401 has 8 divisors (see below), whose sum is σ = 1178806476744. Its totient is φ = 1047475814400.
The previous prime is 1113130140293. The next prime is 1113130140443. The reversal of 1113130140401 is 1040410313111.
It can be written as a sum of positive squares in 4 ways, for example, as 258612931600 + 854517208801 = 508540^2 + 924401^2 .
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-1113130140401 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1113130145401) 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, 5398400 + ... + 5600801.
It is an arithmetic number, because the mean of its divisors is an integer number (147350809593).
Almost surely, 21113130140401 is an apocalyptic number.
It is an amenable number.
1113130140401 is a deficient number, since it is larger than the sum of its proper divisors (65676336343).
1113130140401 is a wasteful number, since it uses less digits than its factorization.
1113130140401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11005171.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 1113130140401 its reverse (1040410313111), we get a palindrome (2153540453512).
The spelling of 1113130140401 in words is "one trillion, one hundred thirteen billion, one hundred thirty million, one hundred forty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •