Base | Representation |
---|---|
bin | 10110101111001100010001… |
… | …001001010111010011110011 |
3 | 111010001220111201102120112002 |
4 | 112233030101021113103303 |
5 | 101101400010333021321 |
6 | 552403212043124215 |
7 | 30030522333413234 |
oct | 2657142111272363 |
9 | 433056451376462 |
10 | 100000011220211 |
11 | 29954848380083 |
12 | b27080951366b |
13 | 43a4c6457401b |
14 | 1a9a0524d308b |
15 | b8636a78920b |
hex | 5af3112574f3 |
100000011220211 has 8 divisors (see below), whose sum is σ = 100307924346000. Its totient is φ = 99692220267360.
The previous prime is 100000011220199. The next prime is 100000011220231. The reversal of 100000011220211 is 112022110000001.
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 100000011220211 - 222 = 100000007025907 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100000011220192 and 100000011220201.
It is not an unprimeable number, because it can be changed into a prime (100000011220231) 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, 28903556 + ... + 32177873.
It is an arithmetic number, because the mean of its divisors is an integer number (12538490543250).
Almost surely, 2100000011220211 is an apocalyptic number.
100000011220211 is a deficient number, since it is larger than the sum of its proper divisors (307913125789).
100000011220211 is an equidigital number, since it uses as much as digits as its factorization.
100000011220211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61086469.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 100000011220211 its reverse (112022110000001), we get a palindrome (212022121220212).
The spelling of 100000011220211 in words is "one hundred trillion, eleven million, two hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •