Base | Representation |
---|---|
bin | 1010000110000111110110… |
… | …1000000000000111111001 |
3 | 1110022011211012200200021222 |
4 | 2201201331220000013321 |
5 | 2423331410100144004 |
6 | 35335224151441425 |
7 | 2223653600552132 |
oct | 241417550000771 |
9 | 43264735620258 |
10 | 11100303131129 |
11 | 359a680807a03 |
12 | 12b3391086275 |
13 | 6269a5989814 |
14 | 2a5386982c89 |
15 | 143b273207be |
hex | a187da001f9 |
11100303131129 has 2 divisors, whose sum is σ = 11100303131130. Its totient is φ = 11100303131128.
The previous prime is 11100303131117. The next prime is 11100303131161. The reversal of 11100303131129 is 92113130300111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10677549593104 + 422753538025 = 3267652^2 + 650195^2 .
It is a cyclic number.
It is not a de Polignac number, because 11100303131129 - 232 = 11096008163833 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11100303131098 and 11100303131107.
It is not a weakly prime, because it can be changed into another prime (11100303136129) 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, 5550151565564 + 5550151565565.
It is an arithmetic number, because the mean of its divisors is an integer number (5550151565565).
Almost surely, 211100303131129 is an apocalyptic number.
It is an amenable number.
11100303131129 is a deficient number, since it is larger than the sum of its proper divisors (1).
11100303131129 is an equidigital number, since it uses as much as digits as its factorization.
11100303131129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 26.
The spelling of 11100303131129 in words is "eleven trillion, one hundred billion, three hundred three million, one hundred thirty-one thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •