Base | Representation |
---|---|
bin | 1010001100001010010100… |
… | …0100001011111110000011 |
3 | 1110200002121002112012022010 |
4 | 2203002211010023332003 |
5 | 2432031340233434321 |
6 | 35455022231344003 |
7 | 2234315441023452 |
oct | 243024504137603 |
9 | 43602532465263 |
10 | 11204044046211 |
11 | 362a676858965 |
12 | 130b503822003 |
13 | 6336c9517083 |
14 | 2aa3c8794b99 |
15 | 146699ba4676 |
hex | a30a510bf83 |
11204044046211 has 24 divisors (see below), whose sum is σ = 15984998529840. Its totient is φ = 6978674563072.
The previous prime is 11204044046207. The next prime is 11204044046233. The reversal of 11204044046211 is 11264044040211.
It is not a de Polignac number, because 11204044046211 - 22 = 11204044046207 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11204044046011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 47044626 + ... + 47282183.
It is an arithmetic number, because the mean of its divisors is an integer number (666041605410).
Almost surely, 211204044046211 is an apocalyptic number.
11204044046211 is a deficient number, since it is larger than the sum of its proper divisors (4780954483629).
11204044046211 is a wasteful number, since it uses less digits than its factorization.
11204044046211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94326983 (or 94326966 counting only the distinct ones).
The product of its (nonzero) digits is 6144, while the sum is 30.
Adding to 11204044046211 its reverse (11264044040211), we get a palindrome (22468088086422).
It can be divided in two parts, 1120404 and 4046211, that added together give a palindrome (5166615).
The spelling of 11204044046211 in words is "eleven trillion, two hundred four billion, forty-four million, forty-six thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •