Base | Representation |
---|---|
bin | 1010001000110010011101… |
… | …0011010101110000000011 |
3 | 1110110120000211122222210021 |
4 | 2202030213103111300003 |
5 | 2430104202433424441 |
6 | 35412240351114311 |
7 | 2230164510441343 |
oct | 242144723256003 |
9 | 43416024588707 |
10 | 11146099514371 |
11 | 3608041663518 |
12 | 1300232212997 |
13 | 62b0c3885543 |
14 | 2a768ccb8d23 |
15 | 144e07b1e3d1 |
hex | a23274d5c03 |
11146099514371 has 2 divisors, whose sum is σ = 11146099514372. Its totient is φ = 11146099514370.
The previous prime is 11146099514357. The next prime is 11146099514443. The reversal of 11146099514371 is 17341599064111.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11146099514371 - 211 = 11146099512323 is a prime.
It is a super-2 number, since 2×111460995143712 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11146099514311) 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, 5573049757185 + 5573049757186.
It is an arithmetic number, because the mean of its divisors is an integer number (5573049757186).
Almost surely, 211146099514371 is an apocalyptic number.
11146099514371 is a deficient number, since it is larger than the sum of its proper divisors (1).
11146099514371 is an equidigital number, since it uses as much as digits as its factorization.
11146099514371 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 816480, while the sum is 52.
The spelling of 11146099514371 in words is "eleven trillion, one hundred forty-six billion, ninety-nine million, five hundred fourteen thousand, three hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •