Base | Representation |
---|---|
bin | 10100101100100011… |
… | …11010000001000001 |
3 | 1001200100201000011001 |
4 | 22112101322001001 |
5 | 140223432223243 |
6 | 5034315452001 |
7 | 542226510244 |
oct | 122621720101 |
9 | 31610630131 |
10 | 11111211073 |
11 | 4791a97376 |
12 | 21a1157001 |
13 | 1080c95011 |
14 | 77597d25b |
15 | 45070aa4d |
hex | 29647a041 |
11111211073 has 2 divisors, whose sum is σ = 11111211074. Its totient is φ = 11111211072.
The previous prime is 11111211031. The next prime is 11111211121. The reversal of 11111211073 is 37011211111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9117767169 + 1993443904 = 95487^2 + 44648^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11111211073 is a prime.
It is a super-2 number, since 2×111112110732 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11111211073.
It is not a weakly prime, because it can be changed into another prime (11111211773) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5555605536 + 5555605537.
It is an arithmetic number, because the mean of its divisors is an integer number (5555605537).
Almost surely, 211111211073 is an apocalyptic number.
It is an amenable number.
11111211073 is a deficient number, since it is larger than the sum of its proper divisors (1).
11111211073 is an equidigital number, since it uses as much as digits as its factorization.
11111211073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 42, while the sum is 19.
Adding to 11111211073 its reverse (37011211111), we get a palindrome (48122422184).
The spelling of 11111211073 in words is "eleven billion, one hundred eleven million, two hundred eleven thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.162 sec. • engine limits •