Base | Representation |
---|---|
bin | 101110110011110010… |
… | …1100111011111000101 |
3 | 100121110120011221000101 |
4 | 1131213211213133011 |
5 | 3121332133141432 |
6 | 114102414444101 |
7 | 10156014165016 |
oct | 1354745473705 |
9 | 317416157011 |
10 | 100522162117 |
11 | 396a415a243 |
12 | 17594803631 |
13 | 962ca54100 |
14 | 4c1854500d |
15 | 2934ece4e7 |
hex | 17679677c5 |
100522162117 has 24 divisors (see below), whose sum is σ = 110857000680. Its totient is φ = 91084481280.
The previous prime is 100522162099. The next prime is 100522162123. The reversal of 100522162117 is 711261225001.
It can be written as a sum of positive squares in 12 ways, for example, as 88771818916 + 11750343201 = 297946^2 + 108399^2 .
It is not a de Polignac number, because 100522162117 - 27 = 100522161989 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100522162127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5237703 + ... + 5256859.
It is an arithmetic number, because the mean of its divisors is an integer number (4619041695).
Almost surely, 2100522162117 is an apocalyptic number.
It is an amenable number.
100522162117 is a deficient number, since it is larger than the sum of its proper divisors (10334838563).
100522162117 is a wasteful number, since it uses less digits than its factorization.
100522162117 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19753 (or 19740 counting only the distinct ones).
The product of its (nonzero) digits is 1680, while the sum is 28.
Adding to 100522162117 its reverse (711261225001), we get a palindrome (811783387118).
The spelling of 100522162117 in words is "one hundred billion, five hundred twenty-two million, one hundred sixty-two thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.151 sec. • engine limits •