Base | Representation |
---|---|
bin | 101110110100111101… |
… | …0100010011000010101 |
3 | 100121120021122021211101 |
4 | 1131221322202120111 |
5 | 3121422131410121 |
6 | 114110331310101 |
7 | 10160000050015 |
oct | 1355172423025 |
9 | 317507567741 |
10 | 100561200661 |
11 | 397141a34a9 |
12 | 175a58ab331 |
13 | 9637b7213c |
14 | 4c1d7c7c45 |
15 | 2938641491 |
hex | 1769ea2615 |
100561200661 has 8 divisors (see below), whose sum is σ = 104038593120. Its totient is φ = 97084459248.
The previous prime is 100561200629. The next prime is 100561200671. The reversal of 100561200661 is 166002165001.
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 100561200661 - 25 = 100561200629 is a prime.
It is a super-2 number, since 2×1005612006612 (a number of 23 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 (100561200671) 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, 162550 + ... + 477016.
It is an arithmetic number, because the mean of its divisors is an integer number (13004824140).
Almost surely, 2100561200661 is an apocalyptic number.
It is an amenable number.
100561200661 is a deficient number, since it is larger than the sum of its proper divisors (3477392459).
100561200661 is a wasteful number, since it uses less digits than its factorization.
100561200661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 325523.
The product of its (nonzero) digits is 2160, while the sum is 28.
Adding to 100561200661 its reverse (166002165001), we get a palindrome (266563365662).
The spelling of 100561200661 in words is "one hundred billion, five hundred sixty-one million, two hundred thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •