Base | Representation |
---|---|
bin | 10110110110100011100110… |
… | …101110000010110010001001 |
3 | 111011212021211022012121221211 |
4 | 112312203212232002302021 |
5 | 101133143001010243410 |
6 | 553431511213133121 |
7 | 30112216663323004 |
oct | 2666434656026211 |
9 | 434767738177854 |
10 | 100506105556105 |
11 | 2a02a444441307 |
12 | b33290b48a1a1 |
13 | 44108ba19a1c2 |
14 | 1ab6742c8053b |
15 | b945db43b68a |
hex | 5b68e6b82c89 |
100506105556105 has 8 divisors (see below), whose sum is σ = 120607590116232. Its totient is φ = 80404708812288.
The previous prime is 100506105556093. The next prime is 100506105556141. The reversal of 100506105556105 is 501655501605001.
It can be written as a sum of positive squares in 4 ways, for example, as 22316582265849 + 78189523290256 = 4724043^2 + 8842484^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100506105556105 - 215 = 100506105523337 is a prime.
It is a Duffinian 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 in 7 ways as a sum of consecutive naturals, for example, 19409352 + ... + 24036121.
It is an arithmetic number, because the mean of its divisors is an integer number (15075948764529).
Almost surely, 2100506105556105 is an apocalyptic number.
It is an amenable number.
100506105556105 is a deficient number, since it is larger than the sum of its proper divisors (20101484560127).
100506105556105 is an equidigital number, since it uses as much as digits as its factorization.
100506105556105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43908155.
The product of its (nonzero) digits is 112500, while the sum is 40.
The spelling of 100506105556105 in words is "one hundred trillion, five hundred six billion, one hundred five million, five hundred fifty-six thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •