Base | Representation |
---|---|
bin | 101110110110010001… |
… | …1100100010110010101 |
3 | 100121200101000111021022 |
4 | 1131230203210112111 |
5 | 3122020002323221 |
6 | 114114553130525 |
7 | 10161045506606 |
oct | 1355443442625 |
9 | 317611014238 |
10 | 100605511061 |
11 | 39737208570 |
12 | 175b86b9a45 |
13 | 96440b7903 |
14 | 4c2563ddad |
15 | 293c4954ab |
hex | 176c8e4595 |
100605511061 has 8 divisors (see below), whose sum is σ = 109753954464. Its totient is φ = 91457482320.
The previous prime is 100605511051. The next prime is 100605511087. The reversal of 100605511061 is 160115506001.
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 100605511061 - 210 = 100605510037 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 100605511061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100605511001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 628511 + ... + 772163.
It is an arithmetic number, because the mean of its divisors is an integer number (13719244308).
Almost surely, 2100605511061 is an apocalyptic number.
100605511061 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
100605511061 is a deficient number, since it is larger than the sum of its proper divisors (9148443403).
100605511061 is a wasteful number, since it uses less digits than its factorization.
100605511061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 207331.
The product of its (nonzero) digits is 900, while the sum is 26.
The spelling of 100605511061 in words is "one hundred billion, six hundred five million, five hundred eleven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •