Base | Representation |
---|---|
bin | 10101000011011110… |
… | …01000100011111001 |
3 | 1002011202101100020201 |
4 | 22201233020203321 |
5 | 141122134002301 |
6 | 5105343322201 |
7 | 550052334451 |
oct | 124157104371 |
9 | 32152340221 |
10 | 11303422201 |
11 | 488053a445 |
12 | 22355b0361 |
13 | 10b1a53006 |
14 | 7932d4d61 |
15 | 462527201 |
hex | 2a1bc88f9 |
11303422201 has 8 divisors (see below), whose sum is σ = 11535333120. Its totient is φ = 11072201712.
The previous prime is 11303422187. The next prime is 11303422217. The reversal of 11303422201 is 10222430311.
It is a happy number.
11303422201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11303422201 - 27 = 11303422073 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11303422231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 139465 + ... + 205078.
It is an arithmetic number, because the mean of its divisors is an integer number (1441916640).
Almost surely, 211303422201 is an apocalyptic number.
It is an amenable number.
11303422201 is a deficient number, since it is larger than the sum of its proper divisors (231910919).
11303422201 is an equidigital number, since it uses as much as digits as its factorization.
11303422201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 345215.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 11303422201 its reverse (10222430311), we get a palindrome (21525852512).
The spelling of 11303422201 in words is "eleven billion, three hundred three million, four hundred twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •