Base | Representation |
---|---|
bin | 10101011011101110… |
… | …00010000100110101 |
3 | 1002200221002222201121 |
4 | 22231313002010311 |
5 | 142031221210011 |
6 | 5141451023541 |
7 | 555102231241 |
oct | 125567020465 |
9 | 32627088647 |
10 | 11506819381 |
11 | 4975332792 |
12 | 229173abb1 |
13 | 1114c29685 |
14 | 7b231d421 |
15 | 475302e71 |
hex | 2addc2135 |
11506819381 has 2 divisors, whose sum is σ = 11506819382. Its totient is φ = 11506819380.
The previous prime is 11506819369. The next prime is 11506819397. The reversal of 11506819381 is 18391860511.
11506819381 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., 10872232900 + 634586481 = 104270^2 + 25191^2 .
It is a cyclic number.
It is not a de Polignac number, because 11506819381 - 217 = 11506688309 is a prime.
It is a super-2 number, since 2×115068193812 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11506819361) 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, 5753409690 + 5753409691.
It is an arithmetic number, because the mean of its divisors is an integer number (5753409691).
Almost surely, 211506819381 is an apocalyptic number.
It is an amenable number.
11506819381 is a deficient number, since it is larger than the sum of its proper divisors (1).
11506819381 is an equidigital number, since it uses as much as digits as its factorization.
11506819381 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 51840, while the sum is 43.
The spelling of 11506819381 in words is "eleven billion, five hundred six million, eight hundred nineteen thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •