Base | Representation |
---|---|
bin | 10101000110101010… |
… | …10010100110101101 |
3 | 1002020121202220021012 |
4 | 22203111102212231 |
5 | 141201012431104 |
6 | 5112141315005 |
7 | 550526061656 |
oct | 124325224655 |
9 | 32217686235 |
10 | 11330202029 |
11 | 4894670533 |
12 | 2242565a65 |
13 | 10b746b373 |
14 | 796aa652d |
15 | 464a66d6e |
hex | 2a35529ad |
11330202029 has 2 divisors, whose sum is σ = 11330202030. Its totient is φ = 11330202028.
The previous prime is 11330202011. The next prime is 11330202071. The reversal of 11330202029 is 92020203311.
11330202029 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11278864804 + 51337225 = 106202^2 + 7165^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11330202029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11330201995 and 11330202013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11330202089) 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, 5665101014 + 5665101015.
It is an arithmetic number, because the mean of its divisors is an integer number (5665101015).
Almost surely, 211330202029 is an apocalyptic number.
It is an amenable number.
11330202029 is a deficient number, since it is larger than the sum of its proper divisors (1).
11330202029 is an equidigital number, since it uses as much as digits as its factorization.
11330202029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 23.
The spelling of 11330202029 in words is "eleven billion, three hundred thirty million, two hundred two thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •