Base | Representation |
---|---|
bin | 1010001011111111110010… |
… | …1111110000110111011101 |
3 | 1110122211022021210212211112 |
4 | 2202333330233300313131 |
5 | 2432010044322320104 |
6 | 35453434113031405 |
7 | 2234155451034512 |
oct | 242777457606735 |
9 | 43584267725745 |
10 | 11201220120029 |
11 | 3629457819375 |
12 | 130aa55b55565 |
13 | 633369460634 |
14 | 2aa1db703309 |
15 | 146581ce086e |
hex | a2ffcbf0ddd |
11201220120029 has 2 divisors, whose sum is σ = 11201220120030. Its totient is φ = 11201220120028.
The previous prime is 11201220119993. The next prime is 11201220120059. The reversal of 11201220120029 is 92002102210211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8344021514404 + 2857198605625 = 2888602^2 + 1690325^2 .
It is a cyclic number.
It is not a de Polignac number, because 11201220120029 - 220 = 11201219071453 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11201220119986 and 11201220120013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11201220120059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5600610060014 + 5600610060015.
It is an arithmetic number, because the mean of its divisors is an integer number (5600610060015).
Almost surely, 211201220120029 is an apocalyptic number.
It is an amenable number.
11201220120029 is a deficient number, since it is larger than the sum of its proper divisors (1).
11201220120029 is an equidigital number, since it uses as much as digits as its factorization.
11201220120029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 23.
The spelling of 11201220120029 in words is "eleven trillion, two hundred one billion, two hundred twenty million, one hundred twenty thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •