Base | Representation |
---|---|
bin | 10110110000110010110100… |
… | …001001000100010111010110 |
3 | 111010110102201101112201002212 |
4 | 112300302310021010113112 |
5 | 101110201011210324342 |
6 | 552525542040433422 |
7 | 30041501045611526 |
oct | 2660626411042726 |
9 | 433412641481085 |
10 | 100110120011222 |
11 | 29997510976512 |
12 | b28a018778872 |
13 | 43b2461471bb9 |
14 | 1aa14d9d15686 |
15 | b891621c1182 |
hex | 5b0cb42445d6 |
100110120011222 has 4 divisors (see below), whose sum is σ = 150165180016836. Its totient is φ = 50055060005610.
The previous prime is 100110120011221. The next prime is 100110120011233. The reversal of 100110120011222 is 222110021011001.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×1001101200112222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100110120011197 and 100110120011206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100110120011221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25027530002804 + ... + 25027530002807.
It is an arithmetic number, because the mean of its divisors is an integer number (37541295004209).
Almost surely, 2100110120011222 is an apocalyptic number.
100110120011222 is a deficient number, since it is larger than the sum of its proper divisors (50055060005614).
100110120011222 is an equidigital number, since it uses as much as digits as its factorization.
100110120011222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50055060005613.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 100110120011222 its reverse (222110021011001), we get a palindrome (322220141022223).
The spelling of 100110120011222 in words is "one hundred trillion, one hundred ten billion, one hundred twenty million, eleven thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •