Base | Representation |
---|---|
bin | 10000000010011100001… |
… | …100110011110000100001 |
3 | 10220100210111020100001201 |
4 | 100002130030303300201 |
5 | 121024131322344301 |
6 | 2202151302401201 |
7 | 142424602252021 |
oct | 20023414636041 |
9 | 3810714210051 |
10 | 1102132231201 |
11 | 395458a03941 |
12 | 159725a30201 |
13 | 7cc1376c841 |
14 | 3b4b4743a81 |
15 | 1da07c83201 |
hex | 1009c333c21 |
1102132231201 has 8 divisors (see below), whose sum is σ = 1112138301960. Its totient is φ = 1092130593792.
The previous prime is 1102132231177. The next prime is 1102132231259. The reversal of 1102132231201 is 1021322312011.
It can be written as a sum of positive squares in 4 ways, for example, as 4197096225 + 1097935134976 = 64785^2 + 1047824^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1102132231201 - 217 = 1102132100129 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1102132231001) 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, 607860 + ... + 1604293.
It is an arithmetic number, because the mean of its divisors is an integer number (139017287745).
Almost surely, 21102132231201 is an apocalyptic number.
It is an amenable number.
1102132231201 is a deficient number, since it is larger than the sum of its proper divisors (10006070759).
1102132231201 is a wasteful number, since it uses less digits than its factorization.
1102132231201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2216675.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 1102132231201 its reverse (1021322312011), we get a palindrome (2123454543212).
The spelling of 1102132231201 in words is "one trillion, one hundred two billion, one hundred thirty-two million, two hundred thirty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •