Base | Representation |
---|---|
bin | 1010010011100000010100… |
… | …1100011011001100001101 |
3 | 1111010011020212122220201201 |
4 | 2210320011030123030031 |
5 | 2441113232440320104 |
6 | 40033005500305501 |
7 | 2246403121234162 |
oct | 244700514331415 |
9 | 44104225586651 |
10 | 11330210870029 |
11 | 367912a726a97 |
12 | 132ba54842291 |
13 | 6425852098cc |
14 | 2b2556b34069 |
15 | 149ad12470a4 |
hex | a4e0531b30d |
11330210870029 has 2 divisors, whose sum is σ = 11330210870030. Its totient is φ = 11330210870028.
The previous prime is 11330210870009. The next prime is 11330210870039. The reversal of 11330210870029 is 92007801203311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7450295807529 + 3879915062500 = 2729523^2 + 1969750^2 .
It is a cyclic number.
It is not a de Polignac number, because 11330210870029 - 215 = 11330210837261 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11330210870029.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11330210870009) 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, 5665105435014 + 5665105435015.
It is an arithmetic number, because the mean of its divisors is an integer number (5665105435015).
Almost surely, 211330210870029 is an apocalyptic number.
It is an amenable number.
11330210870029 is a deficient number, since it is larger than the sum of its proper divisors (1).
11330210870029 is an equidigital number, since it uses as much as digits as its factorization.
11330210870029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18144, while the sum is 37.
The spelling of 11330210870029 in words is "eleven trillion, three hundred thirty billion, two hundred ten million, eight hundred seventy thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •