Base | Representation |
---|---|
bin | 10110111110000100001011… |
… | …100100111110010101110001 |
3 | 111020200121202020102221112220 |
4 | 112332010023210332111301 |
5 | 101220121300210323441 |
6 | 554504530553511253 |
7 | 30164415210655521 |
oct | 2676041344762561 |
9 | 436617666387486 |
10 | 101022120011121 |
11 | 2a2092711178a1 |
12 | b3b691b712529 |
13 | 444a46409275a |
14 | 1ad36d4d19681 |
15 | ba2c3ce6d466 |
hex | 5be10b93e571 |
101022120011121 has 48 divisors (see below), whose sum is σ = 146226088377600. Its totient is φ = 62009898043392.
The previous prime is 101022120011119. The next prime is 101022120011149. The reversal of 101022120011121 is 121110021220101.
It is a happy number.
It is not a de Polignac number, because 101022120011121 - 21 = 101022120011119 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 101022120011121.
It is not an unprimeable number, because it can be changed into a prime (101022120011321) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 700021 + ... + 14231453.
It is an arithmetic number, because the mean of its divisors is an integer number (3046376841200).
Almost surely, 2101022120011121 is an apocalyptic number.
It is an amenable number.
101022120011121 is a deficient number, since it is larger than the sum of its proper divisors (45203968366479).
101022120011121 is a wasteful number, since it uses less digits than its factorization.
101022120011121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13531658 (or 13531641 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 101022120011121 its reverse (121110021220101), we get a palindrome (222132141231222).
The spelling of 101022120011121 in words is "one hundred one trillion, twenty-two billion, one hundred twenty million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •