Base | Representation |
---|---|
bin | 10110111111001101110110… |
… | …011011111000101101101110 |
3 | 111020222011221000011121021102 |
4 | 112333031312123320231232 |
5 | 101222420300340432342 |
6 | 555005132120203102 |
7 | 30203215351335464 |
oct | 2677156633705556 |
9 | 436864830147242 |
10 | 101101222202222 |
11 | 2a239873258850 |
12 | b40a116909492 |
13 | 4454a5c1ba2a8 |
14 | 1ad747a748834 |
15 | ba4d1c6e4832 |
hex | 5bf3766f8b6e |
101101222202222 has 16 divisors (see below), whose sum is σ = 167076367207344. Its totient is φ = 45500100000000.
The previous prime is 101101222202173. The next prime is 101101222202237. The reversal of 101101222202222 is 222202222101101.
It is a junction number, because it is equal to n+sod(n) for n = 101101222202194 and 101101222202203.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22750047779 + ... + 22750052222.
It is an arithmetic number, because the mean of its divisors is an integer number (10442272950459).
Almost surely, 2101101222202222 is an apocalyptic number.
101101222202222 is a deficient number, since it is larger than the sum of its proper divisors (65975145005122).
101101222202222 is a wasteful number, since it uses less digits than its factorization.
101101222202222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45500100115.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 101101222202222 its reverse (222202222101101), we get a palindrome (323303444303323).
It can be divided in two parts, 101101 and 222202222, that multiplied together give a palindrome (22464866846422).
The spelling of 101101222202222 in words is "one hundred one trillion, one hundred one billion, two hundred twenty-two million, two hundred two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •