Base | Representation |
---|---|
bin | 10100100101010000… |
… | …11010111011000001 |
3 | 1001112002112101001101 |
4 | 22102220122323001 |
5 | 140112300113121 |
6 | 5024251534401 |
7 | 540554325400 |
oct | 122250327301 |
9 | 31462471041 |
10 | 11050004161 |
11 | 4760491749 |
12 | 218475a401 |
13 | 10713b4901 |
14 | 76b7a9637 |
15 | 44a16a491 |
hex | 292a1aec1 |
11050004161 has 9 divisors (see below), whose sum is σ = 12854942499. Its totient is φ = 9470801424.
The previous prime is 11050004159. The next prime is 11050004167. The reversal of 11050004161 is 16140005011.
The square root of 11050004161 is 105119.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 3747276225 + 7302727936 = 61215^2 + 85456^2 .
It is not a de Polignac number, because 11050004161 - 21 = 11050004159 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11050004167) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 728325 + ... + 743341.
Almost surely, 211050004161 is an apocalyptic number.
11050004161 is the 105119-th square number.
11050004161 is the 52560-th centered octagonal number.
It is an amenable number.
11050004161 is a deficient number, since it is larger than the sum of its proper divisors (1804938338).
11050004161 is an frugal number, since it uses more digits than its factorization.
11050004161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30048 (or 15024 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 19.
Adding to 11050004161 its reverse (16140005011), we get a palindrome (27190009172).
The spelling of 11050004161 in words is "eleven billion, fifty million, four thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •