Base | Representation |
---|---|
bin | 10110110000101110000011… |
… | …010010111100100111101101 |
3 | 111010102221111221210011100102 |
4 | 112300232003102330213231 |
5 | 101110110022410100221 |
6 | 552523334340040445 |
7 | 30041230233452201 |
oct | 2660560322744755 |
9 | 433387457704312 |
10 | 100105005550061 |
11 | 299953269a0106 |
12 | b28902b993125 |
13 | 43b1b279a8515 |
14 | 1aa117297ab01 |
15 | b88e631aa30b |
hex | 5b0b834bc9ed |
100105005550061 has 8 divisors (see below), whose sum is σ = 102659652380544. Its totient is φ = 97555742592480.
The previous prime is 100105005550021. The next prime is 100105005550087. The reversal of 100105005550061 is 160055500501001.
It is a happy number.
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 100105005550061 - 210 = 100105005549037 is a prime.
It is a super-2 number, since 2×1001050055500612 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100105005550021) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1345930565 + ... + 1346004938.
It is an arithmetic number, because the mean of its divisors is an integer number (12832456547568).
Almost surely, 2100105005550061 is an apocalyptic number.
It is an amenable number.
100105005550061 is a deficient number, since it is larger than the sum of its proper divisors (2554646830483).
100105005550061 is an equidigital number, since it uses as much as digits as its factorization.
100105005550061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2691936451.
The product of its (nonzero) digits is 3750, while the sum is 29.
The spelling of 100105005550061 in words is "one hundred trillion, one hundred five billion, five million, five hundred fifty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •