Base | Representation |
---|---|
bin | 10101011011000010… |
… | …10111010010000001 |
3 | 1002200112102101210211 |
4 | 22231201113102001 |
5 | 142023242422243 |
6 | 5141125154121 |
7 | 555003032464 |
oct | 125541272201 |
9 | 32615371724 |
10 | 11501139073 |
11 | 4972103016 |
12 | 228b85b941 |
13 | 11139bb048 |
14 | 7b16812db |
15 | 474a7ed9d |
hex | 2ad857481 |
11501139073 has 2 divisors, whose sum is σ = 11501139074. Its totient is φ = 11501139072.
The previous prime is 11501139037. The next prime is 11501139079. The reversal of 11501139073 is 37093110511.
Together with previous prime (11501139037) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10834311744 + 666827329 = 104088^2 + 25823^2 .
It is a cyclic number.
It is not a de Polignac number, because 11501139073 - 221 = 11499041921 is a prime.
It is not a weakly prime, because it can be changed into another prime (11501139079) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5750569536 + 5750569537.
It is an arithmetic number, because the mean of its divisors is an integer number (5750569537).
Almost surely, 211501139073 is an apocalyptic number.
It is an amenable number.
11501139073 is a deficient number, since it is larger than the sum of its proper divisors (1).
11501139073 is an equidigital number, since it uses as much as digits as its factorization.
11501139073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2835, while the sum is 31.
Adding to 11501139073 its reverse (37093110511), we get a palindrome (48594249584).
The spelling of 11501139073 in words is "eleven billion, five hundred one million, one hundred thirty-nine thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •