Base | Representation |
---|---|
bin | 10110110000101001100100… |
… | …110111010100000001010101 |
3 | 111010102111010001100001021101 |
4 | 112300221210313110001111 |
5 | 101110020202201201401 |
6 | 552521221432550101 |
7 | 30041000162236456 |
oct | 2660514467240125 |
9 | 433374101301241 |
10 | 100100200022101 |
11 | 2999329033a8a4 |
12 | b28810a552331 |
13 | 43b1540219a56 |
14 | 1aa0c3865d12d |
15 | b88c8136a101 |
hex | 5b0a64dd4055 |
100100200022101 has 4 divisors (see below), whose sum is σ = 100100506000000. Its totient is φ = 100099894044204.
The previous prime is 100100200022063. The next prime is 100100200022131. The reversal of 100100200022101 is 101220002001001.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 100100200022101 - 243 = 91304106999893 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100100200022131) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 152497701 + ... + 153152698.
It is an arithmetic number, because the mean of its divisors is an integer number (25025126500000).
Almost surely, 2100100200022101 is an apocalyptic number.
It is an amenable number.
100100200022101 is a deficient number, since it is larger than the sum of its proper divisors (305977899).
100100200022101 is an equidigital number, since it uses as much as digits as its factorization.
100100200022101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 305977898.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 100100200022101 its reverse (101220002001001), we get a palindrome (201320202023102).
The spelling of 100100200022101 in words is "one hundred trillion, one hundred billion, two hundred million, twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •