Base | Representation |
---|---|
bin | 101111000101000001… |
… | …1110100100111011001 |
3 | 100122221212102211001221 |
4 | 1132022003310213121 |
5 | 3124023212134221 |
6 | 114240034412041 |
7 | 10206236055346 |
oct | 1361203644731 |
9 | 318855384057 |
10 | 101100505561 |
11 | 39970666230 |
12 | 17716431021 |
13 | 96c2809573 |
14 | 4c712917cd |
15 | 296ab70541 |
hex | 178a0f49d9 |
101100505561 has 16 divisors (see below), whose sum is σ = 113913156096. Its totient is φ = 88894800000.
The previous prime is 101100505559. The next prime is 101100505591. The reversal of 101100505561 is 165505001101.
It is a cyclic number.
It is not a de Polignac number, because 101100505561 - 21 = 101100505559 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101100505591) 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 15 ways as a sum of consecutive naturals, for example, 531831 + ... + 696451.
It is an arithmetic number, because the mean of its divisors is an integer number (7119572256).
Almost surely, 2101100505561 is an apocalyptic number.
101100505561 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101100505561 is a deficient number, since it is larger than the sum of its proper divisors (12812650535).
101100505561 is a wasteful number, since it uses less digits than its factorization.
101100505561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 166464.
The product of its (nonzero) digits is 750, while the sum is 25.
Adding to 101100505561 its reverse (165505001101), we get a palindrome (266605506662).
The spelling of 101100505561 in words is "one hundred one billion, one hundred million, five hundred five thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •