Base | Representation |
---|---|
bin | 10010000011001010010… |
… | …001010010111111001101 |
3 | 11101120112201021101220121 |
4 | 102003022101102333031 |
5 | 130310211043104401 |
6 | 2345450050544541 |
7 | 155416612002022 |
oct | 22031221227715 |
9 | 4346481241817 |
10 | 1240344113101 |
11 | 439032a09425 |
12 | 180478898151 |
13 | 8cc6ba41a92 |
14 | 440666ad549 |
15 | 223e69e6ca1 |
hex | 120ca452fcd |
1240344113101 has 8 divisors (see below), whose sum is σ = 1273001175360. Its totient is φ = 1208103064608.
The previous prime is 1240344113069. The next prime is 1240344113171. The reversal of 1240344113101 is 1013114430421.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1240344113101 - 25 = 1240344113069 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 (1240344113171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 103997401 + ... + 104009326.
It is an arithmetic number, because the mean of its divisors is an integer number (159125146920).
Almost surely, 21240344113101 is an apocalyptic number.
It is an amenable number.
1240344113101 is a deficient number, since it is larger than the sum of its proper divisors (32657062259).
1240344113101 is an equidigital number, since it uses as much as digits as its factorization.
1240344113101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 208006883.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 1240344113101 its reverse (1013114430421), we get a palindrome (2253458543522).
The spelling of 1240344113101 in words is "one trillion, two hundred forty billion, three hundred forty-four million, one hundred thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •