Base | Representation |
---|---|
bin | 1010000110110000011110… |
… | …1101111010011100011001 |
3 | 1110100012222022122110212022 |
4 | 2201230013231322130121 |
5 | 2424021224211334004 |
6 | 35344230325024225 |
7 | 2224521065404004 |
oct | 241540755723431 |
9 | 43305868573768 |
10 | 11111209871129 |
11 | 35a4268338115 |
12 | 12b5515855075 |
13 | 627a23490424 |
14 | 2a5add2d853b |
15 | 144064adc2be |
hex | a1b07b7a719 |
11111209871129 has 2 divisors, whose sum is σ = 11111209871130. Its totient is φ = 11111209871128.
The previous prime is 11111209871107. The next prime is 11111209871137. The reversal of 11111209871129 is 92117890211111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10449993696025 + 661216175104 = 3232645^2 + 813152^2 .
It is a cyclic number.
It is not a de Polignac number, because 11111209871129 - 236 = 11042490394393 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11111209871129.
It is not a weakly prime, because it can be changed into another prime (11111209873129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5555604935564 + 5555604935565.
It is an arithmetic number, because the mean of its divisors is an integer number (5555604935565).
Almost surely, 211111209871129 is an apocalyptic number.
It is an amenable number.
11111209871129 is a deficient number, since it is larger than the sum of its proper divisors (1).
11111209871129 is an equidigital number, since it uses as much as digits as its factorization.
11111209871129 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 44.
The spelling of 11111209871129 in words is "eleven trillion, one hundred eleven billion, two hundred nine million, eight hundred seventy-one thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •