Base | Representation |
---|---|
bin | 10110111110000010001101… |
… | …111011100011101100111111 |
3 | 111020200102022022211222211010 |
4 | 112332002031323203230333 |
5 | 101220102441033031421 |
6 | 554503541451530303 |
7 | 30164312033123616 |
oct | 2676021573435477 |
9 | 436612268758733 |
10 | 101020012002111 |
11 | 2a20838a209494 |
12 | b3b6431759993 |
13 | 444a1b942c347 |
14 | 1ad3574d8687d |
15 | ba2b67d73076 |
hex | 5be08dee3b3f |
101020012002111 has 16 divisors (see below), whose sum is σ = 142617707977824. Its totient is φ = 63384563149824.
The previous prime is 101020012002103. The next prime is 101020012002131. The reversal of 101020012002111 is 111200210020101.
It is not a de Polignac number, because 101020012002111 - 23 = 101020012002103 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101020012002101) 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 15 ways as a sum of consecutive naturals, for example, 2415156 + ... + 14417801.
It is an arithmetic number, because the mean of its divisors is an integer number (8913606748614).
Almost surely, 2101020012002111 is an apocalyptic number.
101020012002111 is a deficient number, since it is larger than the sum of its proper divisors (41597695975713).
101020012002111 is a wasteful number, since it uses less digits than its factorization.
101020012002111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16950650.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 101020012002111 its reverse (111200210020101), we get a palindrome (212220222022212).
The spelling of 101020012002111 in words is "one hundred one trillion, twenty billion, twelve million, two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •