Base | Representation |
---|---|
bin | 10101000011011101… |
… | …01011001111101001 |
3 | 1002011202011020112022 |
4 | 22201232223033221 |
5 | 141122121131441 |
6 | 5105340554225 |
7 | 550051324406 |
oct | 124156531751 |
9 | 32152136468 |
10 | 11303302121 |
11 | 4880468201 |
12 | 2235552975 |
13 | 10b1a10467 |
14 | 7932a32ad |
15 | 46250184b |
hex | 2a1bab3e9 |
11303302121 has 2 divisors, whose sum is σ = 11303302122. Its totient is φ = 11303302120.
The previous prime is 11303302111. The next prime is 11303302147. The reversal of 11303302121 is 12120330311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10188076096 + 1115226025 = 100936^2 + 33395^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11303302121 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 11303302121.
It is not a weakly prime, because it can be changed into another prime (11303302111) 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 as a sum of consecutive naturals, namely, 5651651060 + 5651651061.
It is an arithmetic number, because the mean of its divisors is an integer number (5651651061).
Almost surely, 211303302121 is an apocalyptic number.
It is an amenable number.
11303302121 is a deficient number, since it is larger than the sum of its proper divisors (1).
11303302121 is an equidigital number, since it uses as much as digits as its factorization.
11303302121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 11303302121 its reverse (12120330311), we get a palindrome (23423632432).
The spelling of 11303302121 in words is "eleven billion, three hundred three million, three hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •