Base | Representation |
---|---|
bin | 10110110001000111011001… |
… | …011010001110100110111101 |
3 | 111010112112202120202200211022 |
4 | 112301013121122032212331 |
5 | 101111031241321244401 |
6 | 552544035030233525 |
7 | 30043212521364344 |
oct | 2661073132164675 |
9 | 433475676680738 |
10 | 100132220103101 |
11 | 299a592189665a |
12 | b292365ab58a5 |
13 | 43b4573c6a444 |
14 | 1aa25d50acb5b |
15 | b89a074c171b |
hex | 5b11d968e9bd |
100132220103101 has 16 divisors (see below), whose sum is σ = 104283047846400. Its totient is φ = 96028072560000.
The previous prime is 100132220102989. The next prime is 100132220103107. The reversal of 100132220103101 is 101301022231001.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100132220103101 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 100132220103101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100132220103107) 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, 36869201 + ... + 39491801.
It is an arithmetic number, because the mean of its divisors is an integer number (6517690490400).
Almost surely, 2100132220103101 is an apocalyptic number.
It is an amenable number.
100132220103101 is a deficient number, since it is larger than the sum of its proper divisors (4150827743299).
100132220103101 is a wasteful number, since it uses less digits than its factorization.
100132220103101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2631500.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 100132220103101 its reverse (101301022231001), we get a palindrome (201433242334102).
The spelling of 100132220103101 in words is "one hundred trillion, one hundred thirty-two billion, two hundred twenty million, one hundred three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •