Base | Representation |
---|---|
bin | 10110111101101111110001… |
… | …001010011011111000000000 |
3 | 111020121112011201212010112202 |
4 | 112331233301022123320000 |
5 | 101214241403203310422 |
6 | 554450504031012332 |
7 | 30163011106020116 |
oct | 2675576112337000 |
9 | 436545151763482 |
10 | 101000202010112 |
11 | 2a1aaa43a68279 |
12 | b3b262336a0a8 |
13 | 44483802209a2 |
14 | 1ad2616001ab6 |
15 | ba23a8b3ab92 |
hex | 5bdbf129be00 |
101000202010112 has 80 divisors (see below), whose sum is σ = 213802428483072. Its totient is φ = 47500919439360.
The previous prime is 101000202010093. The next prime is 101000202010187. The reversal of 101000202010112 is 211010202000101.
It is a junction number, because it is equal to n+sod(n) for n = 101000202010093 and 101000202010102.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10985912 + ... + 17963592.
Almost surely, 2101000202010112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 101000202010112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (106901214241536).
101000202010112 is an abundant number, since it is smaller than the sum of its proper divisors (112802226472960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101000202010112 is an equidigital number, since it uses as much as digits as its factorization.
101000202010112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6979379 (or 6979363 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 101000202010112 its reverse (211010202000101), we get a palindrome (312010404010213).
The spelling of 101000202010112 in words is "one hundred one trillion, two hundred two million, ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •