Base | Representation |
---|---|
bin | 10110111101111001111011… |
… | …011101100101010101110110 |
3 | 111020122120100002100012221021 |
4 | 112331321323131211111312 |
5 | 101214431224212020042 |
6 | 554455510410411354 |
7 | 30163545345203224 |
oct | 2675717335452566 |
9 | 436576302305837 |
10 | 101011112220022 |
11 | 2a204632548484 |
12 | b3b4769130b5a |
13 | 44493cb66aab4 |
14 | 1ad2d6cdbbb14 |
15 | ba27e6890867 |
hex | 5bde7b765576 |
101011112220022 has 8 divisors (see below), whose sum is σ = 154740427230816. Its totient is φ = 49430969809752.
The previous prime is 101011112219993. The next prime is 101011112220061. The reversal of 101011112220022 is 220022211110101.
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 = 101011112219978 and 101011112220005.
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 3 ways as a sum of consecutive naturals, for example, 537293150013 + ... + 537293150200.
It is an arithmetic number, because the mean of its divisors is an integer number (19342553403852).
Almost surely, 2101011112220022 is an apocalyptic number.
101011112220022 is a deficient number, since it is larger than the sum of its proper divisors (53729315010794).
101011112220022 is a wasteful number, since it uses less digits than its factorization.
101011112220022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1074586300262.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 101011112220022 its reverse (220022211110101), we get a palindrome (321033323330123).
The spelling of 101011112220022 in words is "one hundred one trillion, eleven billion, one hundred twelve million, two hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •