Base | Representation |
---|---|
bin | 1010000110001010011111… |
… | …0000011111110100001001 |
3 | 1110022020122110210101200112 |
4 | 2201202213300133310021 |
5 | 2423334332030014121 |
6 | 35335422242244105 |
7 | 2224010243055533 |
oct | 241424760376411 |
9 | 43266573711615 |
10 | 11101010001161 |
11 | 359aa03819913 |
12 | 12b3549956635 |
13 | 626a89262c02 |
14 | 2a54127c8853 |
15 | 143b693ed75b |
hex | a18a7c1fd09 |
11101010001161 has 2 divisors, whose sum is σ = 11101010001162. Its totient is φ = 11101010001160.
The previous prime is 11101010001157. The next prime is 11101010001199. The reversal of 11101010001161 is 16110001010111.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6340671488761 + 4760338512400 = 2518069^2 + 2181820^2 .
It is a cyclic number.
It is not a de Polignac number, because 11101010001161 - 22 = 11101010001157 is a prime.
It is not a weakly prime, because it can be changed into another prime (11101010001061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5550505000580 + 5550505000581.
It is an arithmetic number, because the mean of its divisors is an integer number (5550505000581).
Almost surely, 211101010001161 is an apocalyptic number.
It is an amenable number.
11101010001161 is a deficient number, since it is larger than the sum of its proper divisors (1).
11101010001161 is an equidigital number, since it uses as much as digits as its factorization.
11101010001161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 14.
Adding to 11101010001161 its reverse (16110001010111), we get a palindrome (27211011011272).
The spelling of 11101010001161 in words is "eleven trillion, one hundred one billion, ten million, one thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •