Base | Representation |
---|---|
bin | 10000000001011000110… |
… | …010101100011101100110 |
3 | 10220020212200012200201011 |
4 | 100001120302230131212 |
5 | 121014322313441402 |
6 | 2201443143052434 |
7 | 142354560511546 |
oct | 20013062543546 |
9 | 3806780180634 |
10 | 1101001312102 |
11 | 394a285a065a |
12 | 15946b14111a |
13 | 7ca93384743 |
14 | 3b408477326 |
15 | 1d98d840ed7 |
hex | 10058cac766 |
1101001312102 has 8 divisors (see below), whose sum is σ = 1651573957176. Its totient is φ = 550476659712.
The previous prime is 1101001312097. The next prime is 1101001312109. The reversal of 1101001312102 is 2012131001011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×11010013121022 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101001312109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11940763 + ... + 12032614.
It is an arithmetic number, because the mean of its divisors is an integer number (206446744647).
Almost surely, 21101001312102 is an apocalyptic number.
1101001312102 is a deficient number, since it is larger than the sum of its proper divisors (550572645074).
1101001312102 is a wasteful number, since it uses less digits than its factorization.
1101001312102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23996342.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 1101001312102 its reverse (2012131001011), we get a palindrome (3113132313113).
The spelling of 1101001312102 in words is "one trillion, one hundred one billion, one million, three hundred twelve thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •