Base | Representation |
---|---|
bin | 10000000000100011000… |
… | …100110110000001101010 |
3 | 10220011112212102101101122 |
4 | 100000203010312001222 |
5 | 121011001111201302 |
6 | 2201213511015242 |
7 | 142323335364605 |
oct | 20004304660152 |
9 | 3804485371348 |
10 | 1100100100202 |
11 | 394605910834 |
12 | 15925936a522 |
13 | 7c97b75556c |
14 | 3b3608c333c |
15 | 1d9396753a2 |
hex | 1002313606a |
1100100100202 has 8 divisors (see below), whose sum is σ = 1653430768416. Its totient is φ = 548956510732.
The previous prime is 1100100100189. The next prime is 1100100100313. The reversal of 1100100100202 is 2020010010011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 1100100100202.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 546768428 + ... + 546770439.
It is an arithmetic number, because the mean of its divisors is an integer number (206678846052).
Almost surely, 21100100100202 is an apocalyptic number.
1100100100202 is a deficient number, since it is larger than the sum of its proper divisors (553330668214).
1100100100202 is a wasteful number, since it uses less digits than its factorization.
1100100100202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1093539372.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 1100100100202 its reverse (2020010010011), we get a palindrome (3120110110213).
The spelling of 1100100100202 in words is "one trillion, one hundred billion, one hundred million, one hundred thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •