Base | Representation |
---|---|
bin | 10110111111010110111101… |
… | …111001100110110010000110 |
3 | 111021000010012012201122100011 |
4 | 112333112331321212302012 |
5 | 101223100322321010042 |
6 | 555013431322340434 |
7 | 30204013053564334 |
oct | 2677267571466206 |
9 | 437003165648304 |
10 | 101111011110022 |
11 | 2a242a368a40a1 |
12 | b40bba905a71a |
13 | 445595c238724 |
14 | 1ad7b2883cb54 |
15 | ba51e1ca6a17 |
hex | 5bf5bde66c86 |
101111011110022 has 8 divisors (see below), whose sum is σ = 152295838311672. Its totient is φ = 50345731672800.
The previous prime is 101111011110007. The next prime is 101111011110023. The reversal of 101111011110022 is 220011110111101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 101111011109984 and 101111011110011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101111011110023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 104886940504 + ... + 104886941467.
It is an arithmetic number, because the mean of its divisors is an integer number (19036979788959).
Almost surely, 2101111011110022 is an apocalyptic number.
101111011110022 is a deficient number, since it is larger than the sum of its proper divisors (51184827201650).
101111011110022 is a wasteful number, since it uses less digits than its factorization.
101111011110022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 209773882214.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 101111011110022 its reverse (220011110111101), we get a palindrome (321122121221123).
The spelling of 101111011110022 in words is "one hundred one trillion, one hundred eleven billion, eleven million, one hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •