Base | Representation |
---|---|
bin | 10110111101101111110001… |
… | …101101001001110001101110 |
3 | 111020121112012100222111122111 |
4 | 112331233301231021301232 |
5 | 101214241413021023042 |
6 | 554450504554034234 |
7 | 30163011246253306 |
oct | 2675576155116156 |
9 | 436545170874574 |
10 | 101000211111022 |
11 | 2a1aaa49113993 |
12 | b3b262641897a |
13 | 4448382089242 |
14 | 1ad26172d0606 |
15 | ba23a9837517 |
hex | 5bdbf1b49c6e |
101000211111022 has 8 divisors (see below), whose sum is σ = 156387423655872. Its totient is φ = 48871069892400.
The previous prime is 101000211110941. The next prime is 101000211111091. The reversal of 101000211111022 is 220111112000101.
It is a happy number.
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 = 101000211110993 and 101000211111011.
It is a congruent number.
It is an unprimeable number.
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, 814517831479 + ... + 814517831602.
It is an arithmetic number, because the mean of its divisors is an integer number (19548427956984).
Almost surely, 2101000211111022 is an apocalyptic number.
101000211111022 is a deficient number, since it is larger than the sum of its proper divisors (55387212544850).
101000211111022 is a wasteful number, since it uses less digits than its factorization.
101000211111022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1629035663114.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 101000211111022 its reverse (220111112000101), we get a palindrome (321111323111123).
The spelling of 101000211111022 in words is "one hundred one trillion, two hundred eleven million, one hundred eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •