Base | Representation |
---|---|
bin | 10000100110101111000… |
… | …011011011001101000101 |
3 | 11001002101110001220121212 |
4 | 100212233003123031011 |
5 | 122143434412302401 |
6 | 2232114322421205 |
7 | 145304413352312 |
oct | 20465703331505 |
9 | 4032343056555 |
10 | 1141103244101 |
11 | 3aaa3703a717 |
12 | 1651a1201805 |
13 | 837b45a5ca2 |
14 | 3d3303b9d09 |
15 | 1ea3925edbb |
hex | 109af0db345 |
1141103244101 has 8 divisors (see below), whose sum is σ = 1219089091680. Its totient is φ = 1064910174768.
The previous prime is 1141103244091. The next prime is 1141103244133. The reversal of 1141103244101 is 1014423011411.
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-1141103244101 is a prime.
It is a super-2 number, since 2×11411032441012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1141103244181) 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, 448193246 + ... + 448195791.
It is an arithmetic number, because the mean of its divisors is an integer number (152386136460).
Almost surely, 21141103244101 is an apocalyptic number.
It is an amenable number.
1141103244101 is a deficient number, since it is larger than the sum of its proper divisors (77985847579).
1141103244101 is an equidigital number, since it uses as much as digits as its factorization.
1141103244101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 896389123.
The product of its (nonzero) digits is 384, while the sum is 23.
Adding to 1141103244101 its reverse (1014423011411), we get a palindrome (2155526255512).
The spelling of 1141103244101 in words is "one trillion, one hundred forty-one billion, one hundred three million, two hundred forty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •