Base | Representation |
---|---|
bin | 10110111111100001001101… |
… | …000001000001100010100111 |
3 | 111021001011120012021100211022 |
4 | 112333201031001001202213 |
5 | 101223240330021143421 |
6 | 555022450110201355 |
7 | 30204552323662523 |
oct | 2677411501014247 |
9 | 437034505240738 |
10 | 101122002131111 |
11 | 2a247666a599a5 |
12 | b412155ab325b |
13 | 44569c133b1c0 |
14 | 1ad848c452d83 |
15 | ba5636b707ab |
hex | 5bf84d0418a7 |
101122002131111 has 16 divisors (see below), whose sum is σ = 109163609436000. Its totient is φ = 93117977682048.
The previous prime is 101122002130927. The next prime is 101122002131147. The reversal of 101122002131111 is 111131200221101.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101122002131111 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 101122002131111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101122002130111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 207554285 + ... + 208040921.
It is an arithmetic number, because the mean of its divisors is an integer number (6822725589750).
Almost surely, 2101122002131111 is an apocalyptic number.
101122002131111 is a deficient number, since it is larger than the sum of its proper divisors (8041607304889).
101122002131111 is a wasteful number, since it uses less digits than its factorization.
101122002131111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 525218.
The product of its (nonzero) digits is 24, while the sum is 17.
Adding to 101122002131111 its reverse (111131200221101), we get a palindrome (212253202352212).
The spelling of 101122002131111 in words is "one hundred one trillion, one hundred twenty-two billion, two million, one hundred thirty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •