Base | Representation |
---|---|
bin | 1010000000101010111001… |
… | …1111010010011111011101 |
3 | 1102222020001020001000120101 |
4 | 2200022232133102133131 |
5 | 2420313041203301031 |
6 | 35224213325421101 |
7 | 2214126433241233 |
oct | 240125637223735 |
9 | 42866036030511 |
10 | 11006633650141 |
11 | 35639838314a8 |
12 | 12991ab40a791 |
13 | 61abc886ac1c |
14 | 2a0a1c5aa953 |
15 | 141493c5a361 |
hex | a02ae7d27dd |
11006633650141 has 2 divisors, whose sum is σ = 11006633650142. Its totient is φ = 11006633650140.
The previous prime is 11006633650123. The next prime is 11006633650169. The reversal of 11006633650141 is 14105633660011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10586238322500 + 420395327641 = 3253650^2 + 648379^2 .
It is a cyclic number.
It is not a de Polignac number, because 11006633650141 - 25 = 11006633650109 is a prime.
It is a super-2 number, since 2×110066336501412 (a number of 27 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 11006633650141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11006633050141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5503316825070 + 5503316825071.
It is an arithmetic number, because the mean of its divisors is an integer number (5503316825071).
Almost surely, 211006633650141 is an apocalyptic number.
It is an amenable number.
11006633650141 is a deficient number, since it is larger than the sum of its proper divisors (1).
11006633650141 is an equidigital number, since it uses as much as digits as its factorization.
11006633650141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 38880, while the sum is 37.
The spelling of 11006633650141 in words is "eleven trillion, six billion, six hundred thirty-three million, six hundred fifty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •