Base | Representation |
---|---|
bin | 10110110000110010110010… |
… | …111101100100100100111110 |
3 | 111010110102200000022012221212 |
4 | 112300302302331210210332 |
5 | 101110200441124021342 |
6 | 552525540052324422 |
7 | 30041500415443031 |
oct | 2660626275444476 |
9 | 433412600265855 |
10 | 100110100220222 |
11 | 29997500789214 |
12 | b28a012013712 |
13 | 43b245a332951 |
14 | 1aa14d7443018 |
15 | b891605b2182 |
hex | 5b0cb2f6493e |
100110100220222 has 8 divisors (see below), whose sum is σ = 150169954325400. Its totient is φ = 50053448778424.
The previous prime is 100110100220209. The next prime is 100110100220227. The reversal of 100110100220222 is 222022001011001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1001101002202222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100110100220197 and 100110100220206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100110100220227) 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, 800587697 + ... + 800712732.
It is an arithmetic number, because the mean of its divisors is an integer number (18771244290675).
Almost surely, 2100110100220222 is an apocalyptic number.
100110100220222 is a deficient number, since it is larger than the sum of its proper divisors (50059854105178).
100110100220222 is a wasteful number, since it uses less digits than its factorization.
100110100220222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1601331690.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 100110100220222 its reverse (222022001011001), we get a palindrome (322132101231223).
The spelling of 100110100220222 in words is "one hundred trillion, one hundred ten billion, one hundred million, two hundred twenty thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •