Base | Representation |
---|---|
bin | 101111000101001100… |
… | …0111110100000100001 |
3 | 100122222020212120010110 |
4 | 1132022120332200201 |
5 | 3124031122113410 |
6 | 114240353321533 |
7 | 10206334153203 |
oct | 1361230764041 |
9 | 318866776113 |
10 | 101106051105 |
11 | 39973803724 |
12 | 177182662a9 |
13 | 96c39cb757 |
14 | 4c71cd6773 |
15 | 296b3b8720 |
hex | 178a63e821 |
101106051105 has 8 divisors (see below), whose sum is σ = 161769681792. Its totient is φ = 53923227248.
The previous prime is 101106051077. The next prime is 101106051217. The reversal of 101106051105 is 501150601101.
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 101106051105 - 28 = 101106050849 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3370201689 + ... + 3370201718.
It is an arithmetic number, because the mean of its divisors is an integer number (20221210224).
Almost surely, 2101106051105 is an apocalyptic number.
101106051105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
101106051105 is a deficient number, since it is larger than the sum of its proper divisors (60663630687).
101106051105 is an equidigital number, since it uses as much as digits as its factorization.
101106051105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6740403415.
The product of its (nonzero) digits is 150, while the sum is 21.
Adding to 101106051105 its reverse (501150601101), we get a palindrome (602256652206).
The spelling of 101106051105 in words is "one hundred one billion, one hundred six million, fifty-one thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •