Base | Representation |
---|---|
bin | 10101000010110010… |
… | …01111100111000101 |
3 | 1002011100120210210101 |
4 | 22201121033213011 |
5 | 141114201341114 |
6 | 5105020324101 |
7 | 546652504651 |
oct | 124131174705 |
9 | 32140523711 |
10 | 11297683909 |
11 | 4878280156 |
12 | 22336a3631 |
13 | 10b07c4185 |
14 | 79263da61 |
15 | 461c91d74 |
hex | 2a164f9c5 |
11297683909 has 2 divisors, whose sum is σ = 11297683910. Its totient is φ = 11297683908.
The previous prime is 11297683861. The next prime is 11297683921. The reversal of 11297683909 is 90938679211.
11297683909 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5891023009 + 5406660900 = 76753^2 + 73530^2 .
It is a cyclic number.
It is not a de Polignac number, because 11297683909 - 27 = 11297683781 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11297683909.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11297683409) 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 as a sum of consecutive naturals, namely, 5648841954 + 5648841955.
It is an arithmetic number, because the mean of its divisors is an integer number (5648841955).
Almost surely, 211297683909 is an apocalyptic number.
It is an amenable number.
11297683909 is a deficient number, since it is larger than the sum of its proper divisors (1).
11297683909 is an equidigital number, since it uses as much as digits as its factorization.
11297683909 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1469664, while the sum is 55.
The spelling of 11297683909 in words is "eleven billion, two hundred ninety-seven million, six hundred eighty-three thousand, nine hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •