Base | Representation |
---|---|
bin | 10100100101011011… |
… | …11011111100010001 |
3 | 1001112012020211112202 |
4 | 22102231323330101 |
5 | 140113132401004 |
6 | 5024342532545 |
7 | 540602530136 |
oct | 122255737421 |
9 | 31465224482 |
10 | 11051450129 |
11 | 476128a065 |
12 | 2185137155 |
13 | 107179cb05 |
14 | 76ba6458d |
15 | 44a353b1e |
hex | 292b7bf11 |
11051450129 has 2 divisors, whose sum is σ = 11051450130. Its totient is φ = 11051450128.
The previous prime is 11051450107. The next prime is 11051450143. The reversal of 11051450129 is 92105415011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10935930625 + 115519504 = 104575^2 + 10748^2 .
It is a cyclic number.
It is not a de Polignac number, because 11051450129 - 212 = 11051446033 is a prime.
It is not a weakly prime, because it can be changed into another prime (11051450629) 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, 5525725064 + 5525725065.
It is an arithmetic number, because the mean of its divisors is an integer number (5525725065).
Almost surely, 211051450129 is an apocalyptic number.
It is an amenable number.
11051450129 is a deficient number, since it is larger than the sum of its proper divisors (1).
11051450129 is an equidigital number, since it uses as much as digits as its factorization.
11051450129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1800, while the sum is 29.
The spelling of 11051450129 in words is "eleven billion, fifty-one million, four hundred fifty thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •