Base | Representation |
---|---|
bin | 10100101011001111… |
… | …00011111000000101 |
3 | 1001122120211000210211 |
4 | 22111213203320011 |
5 | 140213112012331 |
6 | 5033241515421 |
7 | 542033244505 |
oct | 122547437005 |
9 | 31576730724 |
10 | 11100110341 |
11 | 47867a5211 |
12 | 21994a2b71 |
13 | 107b8a9438 |
14 | 7742cda05 |
15 | 44e7668b1 |
hex | 2959e3e05 |
11100110341 has 2 divisors, whose sum is σ = 11100110342. Its totient is φ = 11100110340.
The previous prime is 11100110323. The next prime is 11100110389. The reversal of 11100110341 is 14301100111.
It is a happy number.
11100110341 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10320528100 + 779582241 = 101590^2 + 27921^2 .
It is a cyclic number.
It is not a de Polignac number, because 11100110341 - 221 = 11098013189 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11100110041) by changing a digit.
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 as a sum of consecutive naturals, namely, 5550055170 + 5550055171.
It is an arithmetic number, because the mean of its divisors is an integer number (5550055171).
Almost surely, 211100110341 is an apocalyptic number.
It is an amenable number.
11100110341 is a deficient number, since it is larger than the sum of its proper divisors (1).
11100110341 is an equidigital number, since it uses as much as digits as its factorization.
11100110341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 11100110341 its reverse (14301100111), we get a palindrome (25401210452).
The spelling of 11100110341 in words is "eleven billion, one hundred million, one hundred ten thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •