Base | Representation |
---|---|
bin | 10110110000111100001110… |
… | …001001110110110101111011 |
3 | 111010111101210021122110222111 |
4 | 112300330032021312311323 |
5 | 101110332202321231021 |
6 | 552534332200433151 |
7 | 30042306250144414 |
oct | 2660741611666573 |
9 | 433441707573874 |
10 | 100120220102011 |
11 | 299a082413418a |
12 | b28bb771787b7 |
13 | 43b33b0b05295 |
14 | 1aa1bb749080b |
15 | b89553c508e1 |
hex | 5b0f0e276d7b |
100120220102011 has 4 divisors (see below), whose sum is σ = 106009644813912. Its totient is φ = 94230795390112.
The previous prime is 100120220101997. The next prime is 100120220102047. The reversal of 100120220102011 is 110201022021001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 100120220102011 - 27 = 100120220101883 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100120220101982 and 100120220102000.
It is not an unprimeable number, because it can be changed into a prime (100120220102411) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2944712355925 + ... + 2944712355958.
It is an arithmetic number, because the mean of its divisors is an integer number (26502411203478).
Almost surely, 2100120220102011 is an apocalyptic number.
100120220102011 is a deficient number, since it is larger than the sum of its proper divisors (5889424711901).
100120220102011 is an equidigital number, since it uses as much as digits as its factorization.
100120220102011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5889424711900.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 100120220102011 its reverse (110201022021001), we get a palindrome (210321242123012).
The spelling of 100120220102011 in words is "one hundred trillion, one hundred twenty billion, two hundred twenty million, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •