Base | Representation |
---|---|
bin | 10110110000110010110011… |
… | …100111000100110011000110 |
3 | 111010110102200202202222100101 |
4 | 112300302303213010303012 |
5 | 101110201001420200402 |
6 | 552525541121434314 |
7 | 30041500610065555 |
oct | 2660626347046306 |
9 | 433412622688311 |
10 | 100110111100102 |
11 | 2999750693a454 |
12 | b28a01579b99a |
13 | 43b245c671b4c |
14 | 1aa14d8a75d9c |
15 | b89161510b87 |
hex | 5b0cb39c4cc6 |
100110111100102 has 4 divisors (see below), whose sum is σ = 150165166650156. Its totient is φ = 50055055550050.
The previous prime is 100110111100079. The next prime is 100110111100169. The reversal of 100110111100102 is 201001111011001.
It is a semiprime because it is the product of two primes.
It is a congruent number.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 25027527775024 + ... + 25027527775027.
It is an arithmetic number, because the mean of its divisors is an integer number (37541291662539).
Almost surely, 2100110111100102 is an apocalyptic number.
100110111100102 is a deficient number, since it is larger than the sum of its proper divisors (50055055550054).
100110111100102 is an equidigital number, since it uses as much as digits as its factorization.
100110111100102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50055055550053.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 100110111100102 its reverse (201001111011001), we get a palindrome (301111222111103).
The spelling of 100110111100102 in words is "one hundred trillion, one hundred ten billion, one hundred eleven million, one hundred thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •