Base | Representation |
---|---|
bin | 101110110011010010… |
… | …0010101101111001101 |
3 | 100121102100222112200112 |
4 | 1131212210111233031 |
5 | 3121313243100221 |
6 | 114101004005405 |
7 | 10155415554443 |
oct | 1354644255715 |
9 | 317370875615 |
10 | 100505050061 |
11 | 39695531749 |
12 | 1758ab30865 |
13 | 9629342330 |
14 | 4c1616cb93 |
15 | 293374e15b |
hex | 1766915bcd |
100505050061 has 8 divisors (see below), whose sum is σ = 108238697784. Its totient is φ = 92771758080.
The previous prime is 100505049989. The next prime is 100505050081. The reversal of 100505050061 is 160050505001.
It can be written as a sum of positive squares in 4 ways, for example, as 2567347561 + 97937702500 = 50669^2 + 312950^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100505050061 is a prime.
It is a super-2 number, since 2×1005050500612 (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 (100505050081) 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, 931901 + ... + 1034141.
It is an arithmetic number, because the mean of its divisors is an integer number (13529837223).
Almost surely, 2100505050061 is an apocalyptic number.
It is an amenable number.
100505050061 is a deficient number, since it is larger than the sum of its proper divisors (7733647723).
100505050061 is a wasteful number, since it uses less digits than its factorization.
100505050061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 177871.
The product of its (nonzero) digits is 750, while the sum is 23.
Adding to 100505050061 its reverse (160050505001), we get a palindrome (260555555062).
The spelling of 100505050061 in words is "one hundred billion, five hundred five million, fifty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •