Base | Representation |
---|---|
bin | 10101011011101000… |
… | …00001100111111101 |
3 | 1002200212121221102001 |
4 | 22231310001213331 |
5 | 142031020443401 |
6 | 5141422102301 |
7 | 555062436115 |
oct | 125564014775 |
9 | 32625557361 |
10 | 11506031101 |
11 | 4974944514 |
12 | 229141a991 |
13 | 1114a11936 |
14 | 7b2196045 |
15 | 4751e9601 |
hex | 2add019fd |
11506031101 has 2 divisors, whose sum is σ = 11506031102. Its totient is φ = 11506031100.
The previous prime is 11506031099. The next prime is 11506031111. The reversal of 11506031101 is 10113060511.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10079156025 + 1426875076 = 100395^2 + 37774^2 .
It is an emirp because it is prime and its reverse (10113060511) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11506031101 - 21 = 11506031099 is a prime.
Together with 11506031099, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11506031111) 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 as a sum of consecutive naturals, namely, 5753015550 + 5753015551.
It is an arithmetic number, because the mean of its divisors is an integer number (5753015551).
Almost surely, 211506031101 is an apocalyptic number.
It is an amenable number.
11506031101 is a deficient number, since it is larger than the sum of its proper divisors (1).
11506031101 is an equidigital number, since it uses as much as digits as its factorization.
11506031101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 90, while the sum is 19.
Adding to 11506031101 its reverse (10113060511), we get a palindrome (21619091612).
The spelling of 11506031101 in words is "eleven billion, five hundred six million, thirty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •