Base | Representation |
---|---|
bin | 1010000110001000010000… |
… | …1000001011111011111001 |
3 | 1110022012002210222112202101 |
4 | 2201202010020023323321 |
5 | 2423332121012401132 |
6 | 35335243050103401 |
7 | 2223656364105565 |
oct | 241420410137371 |
9 | 43265083875671 |
10 | 11100412231417 |
11 | 359a727354633 |
12 | 12b340171ab61 |
13 | 6269c24684c2 |
14 | 2a53972626a5 |
15 | 143b31bc17e7 |
hex | a188420bef9 |
11100412231417 has 2 divisors, whose sum is σ = 11100412231418. Its totient is φ = 11100412231416.
The previous prime is 11100412231361. The next prime is 11100412231483. The reversal of 11100412231417 is 71413221400111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9163037756601 + 1937374474816 = 3027051^2 + 1391896^2 .
It is a cyclic number.
It is not a de Polignac number, because 11100412231417 - 215 = 11100412198649 is a prime.
It is not a weakly prime, because it can be changed into another prime (11100412231717) 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, 5550206115708 + 5550206115709.
It is an arithmetic number, because the mean of its divisors is an integer number (5550206115709).
Almost surely, 211100412231417 is an apocalyptic number.
It is an amenable number.
11100412231417 is a deficient number, since it is larger than the sum of its proper divisors (1).
11100412231417 is an equidigital number, since it uses as much as digits as its factorization.
11100412231417 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1344, while the sum is 28.
Adding to 11100412231417 its reverse (71413221400111), we get a palindrome (82513633631528).
The spelling of 11100412231417 in words is "eleven trillion, one hundred billion, four hundred twelve million, two hundred thirty-one thousand, four hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •