Base | Representation |
---|---|
bin | 10000000000100011001… |
… | …100011110010011110101 |
3 | 10220011120000011222220010 |
4 | 100000203030132103311 |
5 | 121011002114201323 |
6 | 2201214021530433 |
7 | 142323361364544 |
oct | 20004314362365 |
9 | 3804500158803 |
10 | 1100102100213 |
11 | 394606a57436 |
12 | 159259b73a19 |
13 | 7c97bca59bc |
14 | 3b360c8415b |
15 | 1d93991cc93 |
hex | 1002331e4f5 |
1100102100213 has 16 divisors (see below), whose sum is σ = 1514162405376. Its totient is φ = 709722953520.
The previous prime is 1100102100197. The next prime is 1100102100221. The reversal of 1100102100213 is 3120012010011.
It is not a de Polignac number, because 1100102100213 - 24 = 1100102100197 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100102100283) 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 15 ways as a sum of consecutive naturals, for example, 3524056 + ... + 3823502.
It is an arithmetic number, because the mean of its divisors is an integer number (94635150336).
Almost surely, 21100102100213 is an apocalyptic number.
It is an amenable number.
1100102100213 is a deficient number, since it is larger than the sum of its proper divisors (414060305163).
1100102100213 is a wasteful number, since it uses less digits than its factorization.
1100102100213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 338984.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 1100102100213 its reverse (3120012010011), we get a palindrome (4220114110224).
The spelling of 1100102100213 in words is "one trillion, one hundred billion, one hundred two million, one hundred thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •