Base | Representation |
---|---|
bin | 10110111111001110100100… |
… | …111010100111101111011110 |
3 | 111020222020221100111222221210 |
4 | 112333032210322213233132 |
5 | 101222423400003323402 |
6 | 555005341334205250 |
7 | 30203243600525661 |
oct | 2677164472475736 |
9 | 436866840458853 |
10 | 101102002011102 |
11 | 2a23a1334587a4 |
12 | b40a2b3ab3826 |
13 | 4454b54920a71 |
14 | 1ad75121396d8 |
15 | ba4d65dce06c |
hex | 5bf3a4ea7bde |
101102002011102 has 32 divisors (see below), whose sum is σ = 213084546670080. Its totient is φ = 31916258343200.
The previous prime is 101102002011097. The next prime is 101102002011139. The reversal of 101102002011102 is 201110200201101.
It is a super-2 number, since 2×1011020020111022 (a number of 29 digits) contains 22 as substring.
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 15 ways as a sum of consecutive naturals, for example, 3626833602 + ... + 3626861477.
It is an arithmetic number, because the mean of its divisors is an integer number (6658892083440).
Almost surely, 2101102002011102 is an apocalyptic number.
101102002011102 is an abundant number, since it is smaller than the sum of its proper divisors (111982544658978).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101102002011102 is a wasteful number, since it uses less digits than its factorization.
101102002011102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7253695208.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 101102002011102 its reverse (201110200201101), we get a palindrome (302212202212203).
The spelling of 101102002011102 in words is "one hundred one trillion, one hundred two billion, two million, eleven thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •