Base | Representation |
---|---|
bin | 10110110000110100100100… |
… | …110110101000000011110101 |
3 | 111010110121121011202222221002 |
4 | 112300310210312220003311 |
5 | 101110213344304031401 |
6 | 552530453431133045 |
7 | 30041565650016500 |
oct | 2660644466500365 |
9 | 433417534688832 |
10 | 100112011002101 |
11 | 299982a132899a |
12 | b28a465b14185 |
13 | 43b26a316cc07 |
14 | 1aa1639116137 |
15 | b892231eea6b |
hex | 5b0d24da80f5 |
100112011002101 has 48 divisors (see below), whose sum is σ = 123657522836400. Its totient is φ = 80533485527040.
The previous prime is 100112011002043. The next prime is 100112011002131. The reversal of 100112011002101 is 101200110211001.
It can be written as a sum of positive squares in 8 ways, for example, as 1450998521476 + 98661012480625 = 1204574^2 + 9932825^2 .
It is not a de Polignac number, because 100112011002101 - 242 = 95713964490997 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100112011002131) 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, 474248825 + ... + 474459873.
It is an arithmetic number, because the mean of its divisors is an integer number (2576198392425).
Almost surely, 2100112011002101 is an apocalyptic number.
It is an amenable number.
100112011002101 is a deficient number, since it is larger than the sum of its proper divisors (23545511834299).
100112011002101 is a wasteful number, since it uses less digits than its factorization.
100112011002101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 212694 (or 212687 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 100112011002101 its reverse (101200110211001), we get a palindrome (201312121213102).
The spelling of 100112011002101 in words is "one hundred trillion, one hundred twelve billion, eleven million, two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •