Base | Representation |
---|---|
bin | 1010010001111100001100… |
… | …0010010001110101000011 |
3 | 1111000120212120122122012210 |
4 | 2210133003002101311003 |
5 | 2440143210231011321 |
6 | 40012402325553203 |
7 | 2244432040112400 |
oct | 244370302216503 |
9 | 44016776578183 |
10 | 11303331110211 |
11 | 3668796809658 |
12 | 13267b2875803 |
13 | 63cb9040839a |
14 | 2b1126c712a7 |
15 | 14905b513b76 |
hex | a47c3091d43 |
11303331110211 has 12 divisors (see below), whose sum is σ = 17531697232392. Its totient is φ = 6459046348608.
The previous prime is 11303331110189. The next prime is 11303331110219. The reversal of 11303331110211 is 11201113330311.
It is not a de Polignac number, because 11303331110211 - 26 = 11303331110147 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (11303331110219) 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 11 ways as a sum of consecutive naturals, for example, 38446704310 + ... + 38446704603.
It is an arithmetic number, because the mean of its divisors is an integer number (1460974769366).
Almost surely, 211303331110211 is an apocalyptic number.
11303331110211 is a deficient number, since it is larger than the sum of its proper divisors (6228366122181).
11303331110211 is an equidigital number, since it uses as much as digits as its factorization.
11303331110211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76893408930 (or 76893408923 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 21.
Adding to 11303331110211 its reverse (11201113330311), we get a palindrome (22504444440522).
The spelling of 11303331110211 in words is "eleven trillion, three hundred three billion, three hundred thirty-one million, one hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •